Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 1994: Algorithms and Computation pp 208–216Cite as

Edge-disjoint paths in permutation graphs

  • Conference paper
  • First Online:

  • 136 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 834))

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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Arvind, V. Kamakoti, C. Pandu Rangan, Efficient Parallel Algorithms for Permutation Graphs, to appear in Journal of Parallel and Distributed Computing.

    Google Scholar 

  2. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, 1980.

    Google Scholar 

  3. C.P. Gopalakrishnan, C. Pandu Rangan, A linear algorithm for the two paths problem on permutation graphs, submitted to Discussiones Mathematicae.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. A. LaPaugh, R.L. Rivest, The subgraph homeomorphism problem, Proc. of the 10th STOC (1978) 40–50.

    Google Scholar 

  6. 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.

    Google Scholar 

  7. A. Schwill, Nonblocking graphs: Greedy algorithms to compute disjoint paths, Proc. of the 7th STACS (1990) 250–262.

    Google Scholar 

  8. Y. Shiloach, A polynomial solution to the undirected two paths problem, J. of the ACM 27 (1980) 445–456.

    Article  Google Scholar 

  9. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Indian Institute of Technology, 600 036, Madras, India

    C. P. Gopalakrishnan & C. Pandu Rangan

Authors
  1. C. P. Gopalakrishnan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. Pandu Rangan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ding-Zhu Du Xiang-Sun Zhang

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation