GRAPH MINERS .13. THE DISJOINT PATHS PROBLEM

摘要

We describe an algorithm, which for fixed k greater than or equal to 0 has running time O(/V(G)/(3)), to solve the following problem: given a graph G and k pairs of vertices of G, decide if there are k mutually vertex-disjoint paths of G joining the pairs. (C) 1995 Academic Press, Inc. [References: 29]