In the edge-disjoint paths problem, we are given a graph and a set of k pairs of vertices, and we have to decide whether or not the graph has k edge-disjoint paths connecting given pairs of terminals. Robertson and Seymour’s graph minor project gives rise to a polynomial time algorithm for this problem for any fixed k, but their proof of the correctness needs the whole Graph Minor project. We give a faster algorithm and a much simpler proof of the correctness for the edge-disjoint paths problem. Our results can be summarized as follows:
If an input graph is either 4-edge-connected or Eulerian, then our algorithm only needs to look for the following three simple reductions: (i) Excluding vertices of high degree. (ii) Excluding ≤3-edge-cuts. (iii) Excluding large clique minors.
When an input graph is either 4-edge-connected or Eulerian, the number of terminals k is allowed to be a non-trivially super constant number, up to k=O((log log logn)½−ε) for any ε > 0. In addition, if an input graph is either 4-edge-connected planar or Eulerian planar, k is allowed to be O((logn ½−ε) for any ε > 0.
We also give our own algorithm for the edge-disjoint paths problem in general graphs. We basically follow the Robertson-Seymour’s algorithm, but we cut half of the proof of the correctness for their algorithm. In addition, our algorithm is faster than Robertson and Seymour’s.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Tax calculation will be finalised during checkout.
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
Tax calculation will be finalised during checkout.
M. Andrews, J. Chuzhoy, S. Khanna and L. Zhang: Hardness of the undirected edge-disjoint paths problem with congestion, Proc. 46th IEEE Symposium on Foundations of Computer Science (FOCS), 2005, 226–244.
S. Arnborg and A. Proskurowski: Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Appl. Math. 23 (1989), 11–24.
H. L. Bodlaender: A linear-time algorithm for finding tree-decomposition of small treewidth, SIAM J. Comput. 25 (1996), 1305–1317.
C. Chekuri, S. Khanna and B. Shepherd: Edge-disjoint paths in planar graphs, Proc. 45th IEEE Symposium on Foundations of Computer Science (FOCS), 2004, 71–80.
C. Chekuri, S. Khanna and B. Shepherd: Edge-disjoint paths in planar graphs with constant congestion, SIAM J. Comput. 39 (2009), 281–301.
E.D. Demaine and M. Hajiaghayi: Fast algorithms for hard graph problems: Bidimensionality, minors, and local treewidth, Proc. 12th Internat. Symp. on Graph Drawing, Lecture Notes in Computer Science 3383, Springer, 2004, 517–533.
E.D. Demaine and M. Hajiaghayi: Linearity of grid minors in treewidth with applications through bidimensionality, Combinatorica 28 (2008), 19–36.
R. Diestel, K.Y. Gorbunov, T.R. Jensen and C. Thomassen: Highly connected sets and the excluded grid theorem, J. Combin. Theory Ser. B 75 (1999), 61–73.
A. Frank: Packing paths, cuts and circuits- a survey, in: Paths, Flows and VLSI-Layout, B. Korte, L. Lovász, H.J. Promel and A. Schrijver (Eds.), Springer-Verlag, Berlin, 1990, 49–100.
V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd and M. Yannakakis: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems, J. Comp. Styst. Sciences 67 (2003), 473–496.
R. Halin: S-functions for graphs, J. Geometry 8 (1976), 171–176.
D. Johnson: The many faces of polynomial time, in: The NP-completeness column: An ongoing guide, J. Algorithms 8 (1987), 285–303.
R. M. Karp: On the computational complexity of combinatorial problems, Networks 5 (1975), 45–68.
K. Kawarabayashi and Y. Kobayashi: The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs, Proc. 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2010, 345–353.
K. Kawarabayashi, Y. Kobayashi and B. Reed: The disjoint paths problem in quadratic time, J. Combin. Theory Ser. B 102 (2012), 424–435.
K. Kawarabayashi and P. Wollan: A shorter proof of the graph minor algorithm the unique linkage theorem, Proc. 42nd ACM Symposium on Theory of Computing (STOC), 2010, 687–694.
J. Kleinberg: An approximation algorithm for the disjoint paths problem in evendegree planar graphs, Proc. 46th IEEE Symposium on Foundations of Computer Science (FOCS), 2005, 627–636.
J. Kleinberg and É. Tardos: Disjoint paths in densely embedded graphs, Proc. 36th IEEE Symposium on Foundations of Computer Science (FOCS), 1995, 52–61.
J. Kleinberg and É. Tardos: Approximations for the disjoint paths problem in high-diameter planar networks, Proc. 27th ACM Symposium on Theory of Computing (STOC), 1995, 26–35.
M. R. Kramer and J. van Leeuwen: The complexity of wire-routing and fingding minimum area layouts for arbitrary VLSI circuits, Adv. Comput. Res. 2 (1984), 129–146.
M. Middendorf and F. Pfeiffer: On the complexity of the disjoint paths problem, Combinatorica 13 (1993), 97–107.
H. Nagamochi and T. Ibaraki: A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph, Algorithmica 7 (1992), 583–596.
T. Nishizeki, J. Vygen and X. Zhou: The edge-disjoint paths problem is NPcomplete for series-parallel graphs, Discrete Appl. Math. 115 (2001), 177–186.
H. Okamura and P. D. Seymour: Multicommodity ows in planar graphs. J. Combin. Theory Ser. B 31 (1981), 75–81.
L. Perkovic and B. Reed: An improved algorithm for finding tree decompositions of small width, International Journal on the Foundations of Computing Science 11 (2000), 81–85.
B. Reed: Finding approximate separators and computing tree width quickly, Proc. 24th ACM Symposium on Theory of Computing (STOC), 1992, 221–228.
B. Reed: Tree width and tangles: a new connectivity measure and some applications, in: Surveys in Combinatorics, London Math. Soc. Lecture Note Ser. 241, Cambridge Univ. Press, Cambridge, 1997, 87–162.
N. Robertson and P. D. Seymour: Graph minors. II. Algorithmic aspects of treewidth, J. Algorithms 7 (1986), 309–322.
N. Robertson and P. D. Seymour: Graph minors. V. Excluding a planar graph, J. Combin. Theory Ser. B 41 (1986), 92–114.
N. Robertson and P. D. Seymour: An outline of a disjoint paths algorithm, in: Paths, Flows, and VLSI-Layout, B. Korte, L. Lovász, H.J. Prömel, and A. Schrijver (Eds.), Springer-Verlag, Berlin, 1990, 267–292.
N. Robertson and P. D. Seymour: Graph minors. XIII. The disjoint paths problem, J. Combin. Theory Ser. B 63 (1995), 65–110.
N. Robertson and P. D. Seymour: Graph minors. XXI. Graphs with unique linkages, J. Combin. Theory Ser. B 99 (2009), 583–616.
N. Robertson and P. D. Seymour: Graph minors. XXII. Irrelevant vertices in linkage problems, J. Combin. Theory Ser. B 102 (2012), 530–563.
N. Robertson, P. D. Seymour and R. Thomas: Quickly excluding a planar graph, J. Combin. Theory Ser. B 62 (1994), 323–348.
A. Schrijver: Combinatorial Optimization: Polyhedra and Efficiency, Springer-Verlag, 2003.
P. D. Seymour: Disjoint paths in graphs, Discrete Math. 29 (1980), 293–309.
P. D. Seymour: On odd cuts and plane multicommodityows, Proceedings of the London Mathematical Society 42 (1981), 178–192.
C. Thomassen: 2-linked graph, European Journal of Combinatorics 1 (1980), 371–378.
C. Thomassen: A simpler proof of the excluded minor theorem for higher surfaces, J. Combin. Theory Ser. B 70 (1997), 306–311.
An extended abstract of this paper appears in SODA 2010 .
Research partly supported by Japan Society for the Promotion of Science, Grant-in-Aid for Scientific Research, by C & C Foundation, by Kayamori Foundation and by Inoue Research Award for Young Scientists.
JST, ERATO, Kawarabayashi Large Graph Project, Japan.
Supported by the Grant-in-Aid for Scientific Research, MEXT, Japan.
About this article
Cite this article
Kawarabayashi, Ki., Kobayashi, Y. The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs. Combinatorica 35, 477–495 (2015). https://doi.org/10.1007/s00493-014-2828-6
Mathematics Subject Classification (2000)