4865 search results - page 81 / 973 » The Complexity of Graph Connectivity |
ISAAC
2004
Springer
14 years 3 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We show that for every connected graph G of diameter 3, the graph G3 has average degree 7 4 (G). We also provide an example showing that this bound is best possible. This resolv...
COMBINATORICS
1999
13 years 10 months ago
1999
Let k denote the maximum degree of the kth iterated line graph Lk(G). For any connected graph G that is not a path, the inequality k+1 2k - 2 holds. Niepel, Knor, and Solt
CORR
2008
Springer
13 years 10 months ago
2008
Springer
In this paper we investigate the affect of various acceptance conditions on recogniser membrane systems without dissolution. We demonstrate that two particular acceptance conditio...
EDBT
2009
ACM
14 years 5 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...