4865 search results - page 37 / 973 » The Complexity of Graph Connectivity |
DAM
2002
13 years 10 months ago
2002
A block graph is a graph whose blocks are cliques. A block duplicate (BD) graph is a graph obtained by adding true twins (i.e., adjacent vertices with the same closed neighborhood...
ENDM
2010
13 years 10 months ago
2010
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...
STACS
2007
Springer
14 years 4 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
RSA
2008
13 years 9 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
TAMC
2009
Springer
14 years 4 months ago
2009
Springer
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set pr...