2283 search results - page 33 / 457 » Bounds of Graph Characteristics |
171
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
151
click to vote
IWPEC
2009
Springer
15 years 12 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
148
click to vote
WG
1998
Springer
15 years 9 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
161
click to vote
WAOA
2007
Springer
15 years 11 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
149
click to vote
ICALP
2000
Springer
15 years 9 months ago
2000
Springer
We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...