LINEAR-TIME ALGORITHMS FOR DISJOINT TWO-FACE PATHS PROBLEMS IN PLANAR GRAPHS
1996 ◽
Vol 07
(02)
◽
pp. 95-110
◽
Keyword(s):
In this paper we present a linear-time algorithm for the vertex-disjoint Two-Face Paths Problem in planar graphs, i.e., the problem of finding k vertex-disjoint paths between pairs of terminals which lie on two face boundaries. The algorithm is based on the idea of finding rightmost paths with a certain property in planar graphs. Using this method, a linear-time algorithm for finding vertex-disjoint paths of a prescribed homotopy is derived. Moreover, the algorithm is modified to solve the more general linkage problem in linear time, as well.
2012 ◽
Vol 78
(2)
◽
pp. 670-680
◽
Keyword(s):
Keyword(s):
2006 ◽
Vol 36
(2)
◽
pp. 283-311
◽
Keyword(s):
1997 ◽
Vol 62
(6)
◽
pp. 315-322
◽
1997 ◽
Vol 07
(03)
◽
pp. 211-223
◽
Keyword(s):
Keyword(s):