Let G = (V,E) be a multigraph with a set T ⊆ V of terminals. A path in G is called a T -path if its ends are distinct vertices in T and no internal vertices belong to T . In 1978, Mader showed a characterization of the maximum number of edge-disjoint T -paths. The original proof was not constructive, and hence it did not suggest an efficient algorithm. In this paper, we provide a combinatorial, deterministic algorithm for finding the maximum number of edge-disjoint T -paths. The algorithm adopts an augmenting path approach. More specifically, we introduce a novel concept of augmenting walks in auxiliary labeled graphs to capture a possible augmentation of the number of edge-disjoint T -paths. To design a search procedure for an augmenting walk, we introduce blossoms analogously to the blossom algorithm of Edmonds (1965) for the matching problem, while it is neither a special case nor a generalization of the present problem. When the search procedure terminates without finding an augmenting walk, the algorithm provides a certificate for the optimality of the current edge-disjoint T -paths. Thus the correctness argument of the algorithm serves as an alternative direct proof of Mader’s theorem on edge-disjoint T -paths. The algorithm runs in O(|V | · |E|) time, which is much faster than the best known deterministic algorithm based on a reduction to the linear matroid parity problem. ∗Supported by JST CREST, No. JPMJCR14D2. †Department of Mathematical Informatics, University of Tokyo, Tokyo 113-8656, Japan. Supported by Grant-inAid for Scientific Research, No. 17H01699 from JSPS. ‡National Institute of Informatics, Tokyo 101-8430, Japan. Supported by Grant-in-Aid for Scientific Research, No. 18K18004 from JSPS.
[1]
W. Mader.
Über die Maximalzahl kantendisjunkterA- Wege
,
1978
.
[2]
L. Lovász.
On some connectivity properties of Eulerian graphs
,
1976
.
[3]
James B. Orlin.
A Fast, Simpler Algorithm for the Matroid Parity Problem
,
2008,
IPCO.
[4]
J. Edmonds.
Paths, Trees, and Flowers
,
1965,
Canadian Journal of Mathematics.
[5]
Alexander Schrijver.
A short proof of Mader's I -paths theorem: 319
,
2001
.
[6]
Alexander Schrijver,et al.
Combinatorial optimization. Polyhedra and efficiency.
,
2003
.
[7]
Judith Keijsper,et al.
A linear programming formulation of Mader's edge-disjoint paths problem
,
2006,
J. Comb. Theory, Ser. B.
[8]
László Lovász,et al.
Matroid matching and some applications
,
1980,
J. Comb. Theory, Ser. B.
[9]
Alexander V. Karzanov,et al.
Multiflows and disjoint paths of minimum total cost
,
1997,
Math. Program..
[10]
W. Mader.
Über die Maximalzahl kreuzungsfreierH-Wege
,
1978
.
[11]
Shin-ichi Tanigawa,et al.
Packing non-zero A-paths via matroid matching
,
2016,
Discret. Appl. Math..
[12]
Lap Chi Lau,et al.
Algebraic Algorithms for Linear Matroid Parity Problems
,
2011,
TALG.
[13]
John H. Vande Vate,et al.
Solving the linear matroid parity problem as a sequence of matroid intersection problems
,
1990,
Math. Program..
[14]
Harold N. Gabow,et al.
An augmenting path algorithm for linear matroid parity
,
1986,
Comb..
[15]
Maria Chudnovsky,et al.
An algorithm for packing non-zero A-paths in group-labelled graphs
,
2008,
Comb..