Abstract
t-joins are generalizations of postman tours, matchings, and paths;t-cuts contain planar multicommodity flows as a special case. In this paper we present a polynomial time combinatorial algorithm that determines a minimumt-join and a maximum packing oft-cuts and that ends up with a Gallai-Edmonds type structural decompostion of (G, t) pairs, independent of the running of the algorithm. It only uses simple combinatorial steps such as the symmetric difference of two sets of edges and does not use any shrinking operations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. Barahona, R. Maynard, R. Rammal and J.P. Uhry, “Morphology of ground states of two-dimensional frustration model,”Journal of Physics A, Mathematical and General 15 (1982) 673–679.
J. Edmonds, “Paths, trees and flowers,”Canadian Journal of Mathematics 17 (1965) 449–467.
J. Edmonds and E. Johnson, “Matching: a well solved class of integer linear programs,” in: R. Guy et al., eds.,Combinatorial Structures and Their Applications (Gordon and Breach, New York, 1976), pp 89–92.
J. Edmonds, “The Chinese postman problem,”Operations Research 13 Suppl. 1 (1965) 373.
J. Edmonds and E.L. Johnson, “Matching, Euler tours and the Chinese postman,”Mathematical Programming 5 (1973) 88–124.
A. Frank, A. Sebõ and É. Tardos, “Covering directed and odd cuts,”Mathematical Programming Study 22 (1984) 99–112.
Mei Gu Guan, “Graphic programming using odd or even points,”Chinese Mathematics 1 (1962) 273–277.
E. Korach, “Packings ofT-cuts and other aspects of dual integrality,” Ph.D. thesis, Waterloo University (1982).
E. Lawler,Combinatorial Optimization: Networks and Matroids (Holt, Rinehart, and Winston, New York, 1976).
L. Lovász, “2-matchings and 2-covers of hypergraphs,”Acta Mathematica, Academiae Scientiarum Hungaricae, 26 (1975) 433–444.
L. Lovász and M.D. Plummer,Matching Theory (Akadémiai Kiadó, to appear).
A. Sebő, “Undirected distances and the structure of odd joins,”Journal of Combinatorial Theory, to appear.
A. Sebő, “The Chinese postman problem: Algorithms, structure and applications,” Working Paper MO/61 MTA SZTAKI (1985)Discrete Applied Mathematics, to appear.
A. Sebő, “A quick proof of Seymour’s theorem ont-joins,” Technical Report 85383-OR, Institut für Ökonometrie und Operations Research, University of Bonn (1985), to appear inDiscrete Mathematics.
A. Sebő, “The Schrijver system of odd join polyhedra,” Technical Report 85394-OR, Institut für Ökonometrie und Operations Research, University of Bonn (1985), to appear inCombinatorica.
P.D. Seymour, “On odd cuts and plane multicommodity flows,”Proceedings of the London Mathematical Society 3, 42 (1981) 178–192.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sebő, A. Finding thet-join structure of graphs. Mathematical Programming 36, 123–134 (1986). https://doi.org/10.1007/BF02592020
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02592020