JAL
2002
13 years 4 months ago
2002
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
IPL
2008
13 years 5 months ago
2008
A path partition of a graph G is a set of vertex-disjoint paths that cover all vertices of G. Given a set P = {{ai, bi}}m i=1 of pairs of distinct vertices of the n-dimensional hy...
ISAAC
2009
Springer
13 years 9 months ago
2009
Springer
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...