2125 search results - page 164 / 425 » On Graph Complexity |
132
click to vote
CSR
2009
Springer
15 years 9 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
176
click to vote
COMPSYSTECH
2011
14 years 2 months ago
2011
Abstract. In a software watermarking environment, several graph theoretic watermark methods encode the watermark values as graph structures and embed them in application programs. ...
141
click to vote
GD
1995
Springer
15 years 6 months ago
1995
Springer
We present a 3-D version of GEM [6], a randomized adaptive layout algorithm for nicely drawing undirected graphs, based on the spring-embedder paradigm [4]. The new version, GEM-3D...
136
click to vote
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
To automatically register foreground target in cluttered images, we present a novel hierarchical graph representation and a stochastic computing strategy in Bayesian framework. Th...
102
click to vote
JGT
2007
15 years 2 months ago
2007
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...