91
Voted
IPL
2008
15 years 7 days 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...