Advertisement

Two arc disjoint paths in Eulerian digraphs

  • András Frank
  • Toshihide Ibaraki
  • Hiroshi Nagamochi
Session 3B
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1004)

Abstract

Let G be an Eulerian digraph, and {x1, x2}, {y1, y2} be two pairs of vertices in G. An instance (G; {x1, x2}, {y1, y2}) is called feasible if it contains two arc-disjoint x′x″- and y′y″- paths, where {x′, x″}= {x1, x2} and {y′, y″}={y1, 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Fortune, J. Hopcroft, and J. Wyllie, The directed subgraph homeomorphism problem, Theoret. Comput. Sci., 10, 1980, pp. 111–121.Google Scholar
  2. 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. 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. 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. 5.
    T. Ibaraki and S. Poljak, Weak three-linking in Eulerian digraphs, SIAM J. Disc. Math., 4, 1991, pp. 84–98.Google Scholar
  6. 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. 7.
    P.D. Seymour, Disjoint paths in graphs, Disc. Math., 29, 1980, pp. 239–309.Google Scholar
  8. 8.
    C. Thomassen, 2-linked graphs, Europ. J. Combinatorics, 1, 1980, pp. 371–378.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • András Frank
    • 1
  • Toshihide Ibaraki
    • 2
  • Hiroshi Nagamochi
    • 2
  1. 1.Dept. of Computer Science, Mathematical InstituteEötvös UniversityBudapest VIIIHungary
  2. 2.Dept. of Applied Mathematics and PhysicsKyoto UniversityKyotoJapan

Personalised recommendations