Skip to main content
Log in

Combinatorial algorithms for matchings, even factors and square-free 2-factors

  • FULL LENGTH PAPER
  • Published:
Mathematical Programming Submit manuscript

Abstract

Even factors and square-free 2-factors are restricted matching problems for which it seems to be difficult to generalize Edmonds’ matching algorithm directly. Here, we present a slight modification of Edmonds’ algorithm, which adapts to these restricted matching problems. Thus, we construct algorithms for these problems which do not use alternating forests.

This is a preview of subscription content, log in via an institution to check access.

Access this article

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. Benczúr, A., Végh, L.: Primal-dual approach for directed vertex-connectivity augmentation and generalizations. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, pp. 186–194 (2005)

  2. Cunningham, W.H., Geelen, J.F.: Vertex-disjoint directed paths and even circuits. Manuscript

  3. Cunningham W.H. and Geelen J.F. (1997). The optimal path-matching problem. Combinatorica 17: 315–337

    Article  MATH  MathSciNet  Google Scholar 

  4. Edmonds J. (1965). Paths, trees and flowers. Can. J. Math. 17: 449–467

    MATH  MathSciNet  Google Scholar 

  5. Frank A. (2003). Restricted t-matchings in bipartite graphs. Discrete Appl. Math. 131(2): 337–346

    Article  MATH  MathSciNet  Google Scholar 

  6. Frank A. and Jordán T. (1995). Minimal edge-coverings of pairs of sets. J. Combin. Theory Ser. B 65: 73–110

    Article  MATH  MathSciNet  Google Scholar 

  7. Frank A. and Szegő L. (2002). A note on the Path-Matching Formula. J. Graph Theory 41(2): 110–119

    Article  MATH  MathSciNet  Google Scholar 

  8. Geelen J.F. (2000). An algebraic matching algorithm. Combinatorica 20: 61–70

    Article  MATH  MathSciNet  Google Scholar 

  9. Hartvigsen, D.: The square-free 2-factor problem in bipartite graphs. In: Integer Programming and Combinatorial Optimization Conference. Lecture Notes in Computer Science, vol. 1610, pp. 234–240 (Extended abstract) (1999)

  10. Hartvigsen, D.: Finding maximum square-free 2-matchings in bipartite graphs. J. Combin. Theory Ser. B (in press)

  11. Király, Z.: C 4-free 2-factors in bipartite graphs, EGRES Technical Report TR-2001-13, http://www.cs.elte.hu/egres

  12. Pap, G.: Alternating paths revisited I: even factors, EGRES Technical Report TR-2004-18, http://www.cs.elte.hu/egres

  13. Pap G. and Szegő L. (2004). On the maximum even factor in weakly symmetric graphs. J. Comb. Theory Ser. B 91(2): 201–213

    Article  MATH  Google Scholar 

  14. Spille, B., Weismantel, R.: A generalization of Edmonds’matching and matroid intersection algorithms. In: Integer Programming and Combinatorial Optimization Conference. Lecture Notes in Computer Science, vol. 2337, pp. 9–20 (Extended abstract) (2002)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gyula Pap.

Additional information

The author is a member of the Egerváry Research Group (EGRES). Research is supported by OTKA grants T 037547 and TS 049788, by European MCRTN Adonet, Contract Grant No. 504438 and by the Egerváry Research Group of the Hungarian Academy of Sciences.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pap, G. Combinatorial algorithms for matchings, even factors and square-free 2-factors. Math. Program. 110, 57–69 (2007). https://doi.org/10.1007/s10107-006-0053-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-006-0053-9

Keywords

Navigation