Advertisement

Combinatorica

, Volume 13, Issue 1, pp 97–107 | Cite as

On the complexity of the disjoint paths problem

  • Matthias Middendorf
  • Frank Pfeiffer
Article

Abstract

In this paper we consider the disjoint paths problem. Given a graphG and a subsetS of the edge-set ofG the problem is to decide whether there exists a family ℱ of disjoint circuits inG each containing exactly one edge ofS such that every edge inS belongs to a circuit inC. By a well-known theorem of P. Seymour the edge-disjoint paths problem is polynomially solvable for Eulerian planar graphsG. We show that (assumingPNP) one can drop neither planarity nor the Eulerian condition onG without losing polynomial time solvability. We prove theNP-completeness of the planar edge-disjoint paths problem by showing theNP-completeness of the vertex disjoint paths problem for planar graphs with maximum vertex-degree three. This disproves (assumingPNP) a conjecture of A. Schrijver concerning the existence of a polynomial time algorithm for the planar vertex-disjoint paths problem. Furthermore we present a counterexample to a conjecture of A. Frank. This conjecture would have implied a polynomial algorithm for the planar edge-disjoint paths problem. Moreover we derive a complete characterization of all minorclosed classes of graphs for which the disjoint paths problem is polynomially solvable. Finally we show theNP-completeness of the half-integral relaxation of the edge-disjoint paths problem. This implies an answer to the long-standing question whether the edge-disjoint paths problem is polynomially solvable for Eulerian graphs.

AMS subject classification code (1991)

05 C 38 68 R 10 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Lichtenstein, D.: Planar formulae and their uses,SIAM J. Comput. 11 (1982), 329–343.Google Scholar
  2. [2]
    Lomonosov, M. V.: Combinatorial approaches to multiflow problems,Discrete Applied Mathematics 11 (1985), 1–93.Google Scholar
  3. [3]
    Matoušek, J., Thomas, R.: On the complexity of finding iso- and other morphisms for partialk-trees, In preparation (manuscript May 1988).Google Scholar
  4. [4]
    Middendorf, M., Pfeiffer, F.: Edge disjoint paths in graphs with bounded tree-whidth, In preparation.Google Scholar
  5. [5]
    Robertson, N., Seymour, P. D.: Graph minors V. Excluding a planar graph,J. Combinatorial Theory (Ser. B),36 (1984), 49–64.Google Scholar
  6. [6]
    Schrijver, A.: Homotopic Routing Methods, in:Paths, Flows and VLSI Layout. (Korte, B., Lovász, L., Prömel, H.-J., Schrijver, A. eds.) Springer 1990.Google Scholar
  7. [7]
    Sebő, A.: Dual Integrality and Multicommodity Flows, in: Colloquia Mathematica Societatis János Bolyai,52.Combinatorics, (eds.: A. Hajnal, L. Lovász and V. T. Sós).Google Scholar
  8. [8]
    Sebő, A.: Integer plane multicommodity flows with a bounded number of demands, Technical Report, Bonn, 1988, 88534-OR.Google Scholar
  9. [9]
    Seymour, P. D.: On odd cuts and plane multicommodity flows,Proc. London Math. Soc. (3)42 (1981), 178–192.Google Scholar
  10. [10]
    Seymour, P. D.: Matroids and multicommodity flows,Europ. J. Combinatorics 2 (1981), 257–290.Google Scholar

Copyright information

© Akadémiai Kiadó 1993

Authors and Affiliations

  • Matthias Middendorf
    • 1
  • Frank Pfeiffer
    • 2
  1. 1.CGK Comouter Gesellschaft KonstanzKonstanzGermany
  2. 2.Institut für Informatik der Universität zu KölnGermany

Personalised recommendations