153 search results - page 3 / 31 » Edge Disjoint Paths in Moderately Connected Graphs |
CPC
2000
14 years 9 months ago
2000
FOCS
1996
IEEE
15 years 1 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
75
Voted
SOFSEM
2007
Springer
15 years 3 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
ICALP
2010
Springer
15 years 1 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
RANDOM
1998
Springer
15 years 1 months ago
1998
Springer
There has been a significant amount of research lately on solving the edge disjoint path and related problems on expander graphs. We review the random walk approach of Broder, Fri...