434 search results - page 1 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
SOFSEM
2009
Springer
15 years 10 months ago
2009
Springer
ICALP
2010
Springer
15 years 5 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...
140
Voted
MOR
2000
15 years 1 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
133
click to vote
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...
148
Voted
FOCS
1995
IEEE
15 years 5 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...