39 search results - page 6 / 8 » Kernel Bounds for Disjoint Cycles and Disjoint Paths |
158
click to vote
ICALP
2007
Springer
16 years 4 days ago
2007
Springer
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
207
click to vote
FOCS
2009
IEEE
16 years 22 days ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
158
click to vote
MST
2010
15 years 23 days ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
153
click to vote
IPPS
2007
IEEE
16 years 8 days ago
2007
IEEE
This paper addresses a constrained two-terminal reliability measure referred to as Distance Reliability (DR) between the source node u and the destination node I with the shortest...
135
click to vote
DM
2008
15 years 6 months ago
2008
Let G be a minimally k-connected graph with n nodes and m edges. Mader proved that if n 3k - 2 then m k(n - k), and for n 3k - 1 an equality is possible if, and only if, G is t...