1172 search results - page 70 / 235 » Path Algorithms on Regular Graphs |
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
We study (vertex-disjoint) packings of paths of length two (i.e., of P2's) in graphs under a parameterized perspective. Starting from a maximal P2-packing P of size j we use e...
82
Voted
SIROCCO
2003
15 years 1 months ago
2003
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
APPROX
2010
Springer
15 years 2 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
102
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these ...
117
click to vote
SIAMCOMP
1998
15 years 3 days ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...