Abstract
In this paper we consider the following problem. Given an undirected graph G=(V, E) and vertices s 1, t 1; s 2, t 2, the problem is to determine whether or not G admits two edge-disjoint paths P 1 and P 2 connecting s 1 with t 1 and s 2 with t 2 respectively. We give a linear (O(¦ V ¦ + ¦ E ¦)) algorithm to solve this problem on a permutation graph.
Preview
Unable to display preview. Download preview PDF.
References
K. Arvind, V. Kamakoti, C. Pandu Rangan, Efficient Parallel Algorithms for Permutation Graphs, to appear in Journal of Parallel and Distributed Computing.
M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, 1980.
C.P. Gopalakrishnan, C. Pandu Rangan, A linear algorithm for the two paths problem on permutation graphs, submitted to Discussiones Mathematicae.
S.V. Krishnan, C. Pandu Rangan, S. Seshadri, A. Schwill, Two Disjoint Paths in Chordal graphs, Technical report, 2/91, February 1991, University of Oldenburg, Germany.
A. LaPaugh, R.L. Rivest, The subgraph homeomorphism problem, Proc. of the 10th STOC (1978) 40–50.
T. Ohtsuki, The two disjoint path problem and wire routing design, In Proc. of the 17th Symp. of Res. Inst. of Electrical Comm. (1980) 257–267.
A. Schwill, Nonblocking graphs: Greedy algorithms to compute disjoint paths, Proc. of the 7th STACS (1990) 250–262.
Y. Shiloach, A polynomial solution to the undirected two paths problem, J. of the ACM 27 (1980) 445–456.
A. Srinivasa Rao, C. Pandu Rangan, Linear algorithms for parity path and two path problems on circular arc graphs, BIT Vol 31 (1991) 182–193.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gopalakrishnan, C.P., Pandu Rangan, C. (1994). Edge-disjoint paths in permutation graphs. In: Du, DZ., Zhang, XS. (eds) Algorithms and Computation. ISAAC 1994. Lecture Notes in Computer Science, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58325-4_183
Download citation
DOI: https://doi.org/10.1007/3-540-58325-4_183
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58325-7
Online ISBN: 978-3-540-48653-4
eBook Packages: Springer Book Archive