Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph

Abstract

Gwen a graph G = (V, E) and four verttces s1, t2, s2, and t2, the problem of finding two disjoint paths, P1 from s2 to t2 and P2 from s2 to t2, is considered This problem may arise as a transportation network problem and m printed clrcmts routing The relations between several vemons of the problem are discussed Efficient algorithms are gwen for the following special cases-acyche directed graphs and 3-connected planar and chordal graphs. © 1978, ACM. All rights reserved.