Title of article
Graph Minors .XIII. The Disjoint Paths Problem
Author/Authors
Robertson، نويسنده , , N. and Seymour، نويسنده , , P.D.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1995
Pages
46
From page
65
To page
110
Abstract
We describe an algorithm, which for fixed k ≥ 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.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1995
Journal title
Journal of Combinatorial Theory Series B
Record number
1525973
Link To Document