GRAPH MINERS .13. THE DISJOINT PATHS PROBLEM
GRAPH MINERS .13. THE DISJOINT PATHS PROBLEM
复制标题
DOI：
10.1006/jctb.1995.1006
复制
发表时间：
1995-01-01
影响因子：
1.4
通讯作者：
SEYMOUR, PD
中科院分区：
文献类型：
--
作者：
ROBERTSON, N;SEYMOUR, PD
我们描述了一种算法，当k大于等于0时，其运行时间为O(/V(G)/(3))，用于解决如下问题：给定一个图G和k对G的顶点，判断是否有k条相互顶点不相交的路径将G的顶点对连接起来。(C) 1995学术出版社，Inc。
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.