4865 search results - page 33 / 973 » The Complexity of Graph Connectivity |
ICLA
2009
Springer
13 years 7 months ago
2009
Springer
Abstract. Connection matrices of graph parameters were first introduced by M. Freedman, L. Lov
ICOIN
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
JGT
2010
13 years 8 months ago
2010
We study vertex-colorings of plane graphs that do not contain a rainbow face, i.e., a face with vertices of mutually distinct colors. If G is a 3-connected plane graph with n vert...
SIAMCOMP
1998
13 years 9 months ago
1998
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
DAM
2002
13 years 10 months ago
2002
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...