Skip to main content
SpringerLink
Log in

Two arc disjoint paths in Eulerian digraphs

  • Session 3B
  • Conference paper
  • First Online:
Algorithms and Computations (ISAAC 1995)

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

Included in the following conference series:

Abstract

Let G be an Eulerian digraph, and {x 1, x2}, {y 1, y2} be two pairs of vertices in G. An instance (G; {x 1, x2}, {y 1, y2}) is called feasible if it contains two arc-disjoint x′x″- and y′y″- paths, where {x′, x″}= {x 1, x2} and {y′, y″}={y 1, y2}. An O(m+nlog n) time algorithm is presented to decide whether G is feasible, where n and m are the number of vertices and arcs in G, respectively. The algorithm is based on a structural characterization of minimal infeasible instances.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Fortune, J. Hopcroft, and J. Wyllie, The directed subgraph homeomorphism problem, Theoret. Comput. Sci., 10, 1980, pp. 111–121.

    Google Scholar 

  2. A. Frank, On connectivity properties of Eulerian digraphs, in Graph Theory in Memory of G.A. Dirac, Annals of Discrete Mathematics 41, Noth-Holland, Amsterdam, 1988, pp. 179–194.

    Google Scholar 

  3. A. Frank, T. Ibaraki and H. Nagamochi, Two arc disjoint paths in Eulerian digraphs, Technical Report #95008, Kyoto University, Faculty of Engineering, Department of Applied Mathematics and Physics, 1995.

    Google Scholar 

  4. H. N. Gabow, Applications of a poset representation to edge connectivity and graph rigidity, Proc. 32nd IEEE Symp. Found. Comp. Sci., San Juan, Puerto Rico, 1991, pp. 812–821.

    Google Scholar 

  5. T. Ibaraki and S. Poljak, Weak three-linking in Eulerian digraphs, SIAM J. Disc. Math., 4, 1991, pp. 84–98.

    Google Scholar 

  6. N. Robertson and P.D. Seymour, Graph minors XIII: The disjoint path problem, 1986 (to appear in J. Combinatorial Theory B).

    Google Scholar 

  7. P.D. Seymour, Disjoint paths in graphs, Disc. Math., 29, 1980, pp. 239–309.

    Google Scholar 

  8. C. Thomassen, 2-linked graphs, Europ. J. Combinatorics, 1, 1980, pp. 371–378.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Mathematical Institute, Eötvös University, Múseum körút 6-8, 1088, Budapest VIII, Hungary

    András Frank

  2. Dept. of Applied Mathematics and Physics, Kyoto University, 606-01, Kyoto, Japan

    Toshihide Ibaraki & Hiroshi Nagamochi

Authors
  1. András Frank
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Toshihide Ibaraki
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hiroshi Nagamochi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John Staples Peter Eades Naoki Katoh Alistair Moffat

Additional information

This paper is dedicated to the late Svatopluk Poljak, whose untimely death in a car accident is a great loss to our community.

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Frank, A., Ibaraki, T., Nagamochi, H. (1995). Two arc disjoint paths in Eulerian digraphs. In: Staples, J., Eades, P., Katoh, N., Moffat, A. (eds) Algorithms and Computations. ISAAC 1995. Lecture Notes in Computer Science, vol 1004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015412

Download citation

  • DOI: https://doi.org/10.1007/BFb0015412

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60573-7

  • Online ISBN: 978-3-540-47766-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation