Skip to main content
Springer Nature Link
Log in

Finding thet-join structure of graphs

  • Published:
Mathematical Programming Submit manuscript

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.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. 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.

    Article  MathSciNet  Google Scholar 

  2. J. Edmonds, “Paths, trees and flowers,”Canadian Journal of Mathematics 17 (1965) 449–467.

    MATH  MathSciNet  Google Scholar 

  3. 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.

    Google Scholar 

  4. J. Edmonds, “The Chinese postman problem,”Operations Research 13 Suppl. 1 (1965) 373.

    Google Scholar 

  5. J. Edmonds and E.L. Johnson, “Matching, Euler tours and the Chinese postman,”Mathematical Programming 5 (1973) 88–124.

    Article  MATH  MathSciNet  Google Scholar 

  6. A. Frank, A. Sebõ and É. Tardos, “Covering directed and odd cuts,”Mathematical Programming Study 22 (1984) 99–112.

    MATH  Google Scholar 

  7. Mei Gu Guan, “Graphic programming using odd or even points,”Chinese Mathematics 1 (1962) 273–277.

    Google Scholar 

  8. E. Korach, “Packings ofT-cuts and other aspects of dual integrality,” Ph.D. thesis, Waterloo University (1982).

  9. E. Lawler,Combinatorial Optimization: Networks and Matroids (Holt, Rinehart, and Winston, New York, 1976).

    MATH  Google Scholar 

  10. L. Lovász, “2-matchings and 2-covers of hypergraphs,”Acta Mathematica, Academiae Scientiarum Hungaricae, 26 (1975) 433–444.

    Article  MATH  MathSciNet  Google Scholar 

  11. L. Lovász and M.D. Plummer,Matching Theory (Akadémiai Kiadó, to appear).

  12. A. Sebő, “Undirected distances and the structure of odd joins,”Journal of Combinatorial Theory, to appear.

  13. A. Sebő, “The Chinese postman problem: Algorithms, structure and applications,” Working Paper MO/61 MTA SZTAKI (1985)Discrete Applied Mathematics, to appear.

  14. 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.

  15. 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.

  16. P.D. Seymour, “On odd cuts and plane multicommodity flows,”Proceedings of the London Mathematical Society 3, 42 (1981) 178–192.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer and Automation Institute of the Hungarian Academy of Sciences, Budapest, Hungary

    András Sebő

Authors
  1. András Sebő
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02592020

Key words