Abstract
Let G= (V,E) be a finite undirected graph with four distinguished vertices s, t, u, v. The two path problem (TPP) is to determine whether there exist two vertex disjoint paths connecting s with t and u with v and to find such paths if they exist.
In this paper, a simple and efficient algorithm for TPP restricted to 2-connected chordal graphs is given. The reduction of TPP for a general chordal graph to the TPP for a 2-connected chordal graph is outlined.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Ebert,J., A Linear Disjoint Path Algorithm, Proceedings WG82, Munich: Hanser Verlag (1982) 37–45.
Golumbic,M.C., Algorithmic Graph Theory and Perfect Graphs, Academic Press 1980.
Ohtsuki, T., The two disjoint path problem and wire routing design, Graph Theory and Algorithms (Eds. Saito,N. and Nishizeki,T.) Springer 108 (1980) 207–216.
Perl, Y. and Shiloach, Y., Finding two disjoint paths between two pairs of vertices in a graph, Journal of ACM, 25 (1978) 1–9.
Ramprasad,P.B. and Pandu Rangan,C., A new linear algorithm for the two path problem on planar graphs (To appear).
Shiloach, Y., A polynomial solution to the undirected two path problem, Journal of ACM, 27 (1980) 445–456.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krishnan, S.V., Pandu Rangan, C., Seshadri, S. (1988). A new linear algorithm for the two path problem on chordal graphs. In: Nori, K.V., Kumar, S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1988. Lecture Notes in Computer Science, vol 338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50517-2_70
Download citation
DOI: https://doi.org/10.1007/3-540-50517-2_70
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50517-4
Online ISBN: 978-3-540-46030-5
eBook Packages: Springer Book Archive