Skip to main content
SpringerLink
Log in

Kardinalitätsmaximale Matchings

  • Chapter
  • First Online:
Kombinatorische Optimierung

Part of the book series: Masterclass ((MASTERCLASS))

  • 6256 Accesses

Zusammenfassung

In diesem Kapitel zeigen wir, wie ein Matching maximaler Kardinalität in einem Graphen in polynomieller Zeit gefunden werden kann. Dies ist in bipartiten Graphen wesentlich einfacher als in allgemeinen. Einige Struktursätze haben grundlegende Bedeutung in der kombinatorischen Optimierung.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

Allgemeine Literatur:

  • Gerards, A.M.H. [1995]: Matching. In: Handbooks in Operations Research and Management Science; Volume 7: Network Models (M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser, Hrsg.), Elsevier, Amsterdam 1995, pp. 135–224

    Google Scholar 

  • Lawler, E.L. [1976]: Combinatorial Optimization; Networks and Matroids. Holt, Rinehart and Winston, New York 1976, Kapitel 5 und 6

    Google Scholar 

  • Lovász, L., und Plummer, M.D. [1986]: Matching Theory. Akadémiai Kiadó, Budapest 1986, und North-Holland, Amsterdam 1986

    Google Scholar 

  • Papadimitriou, C.H., und Steiglitz, K. [1982]: Combinatorial Optimization; Algorithms and Complexity. Prentice-Hall, Englewood Cliffs 1982, Kapitel 10

    Google Scholar 

  • Pulleyblank, W.R. [1995]: Matchings and extensions. In: Handbook of Combinatorics; Vol. 1 (R.L. Graham, M. Grötschel, L. Lovász, Hrsg.), Elsevier, Amsterdam 1995

    Google Scholar 

  • Schrijver, A. [2003]: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin 2003, Kapitel 16 und 24

    Google Scholar 

  • Tarjan, R.E. [1983]: Data Structures and Network Algorithms. SIAM, Philadelphia 1983, Kapitel 9

    Google Scholar 

Zitierte Literatur:

  • Alt, H., Blum, N., Mehlhorn, K., und Paul, M. [1991]: Computing a maximum cardinality matching in a bipartite graph in time \( O\left( {n^{1,5} \sqrt {m/\,\text{log}\,n} } \right) \). Information Processing Letters 37 (1991), 237–240

    Article  MathSciNet  Google Scholar 

  • Anderson, I. [1971]: Perfect matchings of a graph. Journal of Combinatorial Theory B 10 (1971), 183–186

    Article  MathSciNet  Google Scholar 

  • Berge, C. [1957]: Two theorems in graph theory. Proceedings of the National Academy of Science of the U.S. 43 (1957), 842–844

    Article  MathSciNet  Google Scholar 

  • Berge, C. [1958]: Sur le couplage maximum d’un graphe. Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences (Paris) Sér. I Math. 247 (1958), 258–259

    Google Scholar 

  • Brègman, L.M. [1973]: Certain properties of nonnegative matrices and their permanents. Doklady Akademii Nauk SSSR 211 (1973), 27–30 [auf Russisch]. English translation: Soviet Mathematics Doklady 14 (1973), 945–949

    Google Scholar 

  • Dilworth, R.P. [1950]: A decomposition theorem for partially ordered sets. Annals of Mathematics 51 (1950), 161–166

    Article  MathSciNet  Google Scholar 

  • Edmonds, J. [1965]: Paths, trees, and flowers. Canadian Journal of Mathematics 17 (1965), 449–467

    Article  MathSciNet  Google Scholar 

  • Egoryčev, G.P. [1980]: Solution of the van der Waerden problem for permanents. Soviet Mathematics Doklady 23 (1982), 619–622

    Google Scholar 

  • Erdős, P., und Gallai, T. [1961]: On the minimal number of vertices representing the edges of a graph. Magyar Tudományos Akadémia; Matematikai Kutató Intézetének Közleményei 6 (1961), 181–203

    Google Scholar 

  • Falikman, D.I. [1981]: A proof of the van der Waerden conjecture on the permanent of a doubly stochastic matrix. Matematicheskie Zametki 29 (1981), 931–938 [auf Russisch]. Englische Übersetzung: Math. Notes of the Acad. Sci. USSR 29 (1981), 475–479

    Google Scholar 

  • Feder, T., und Motwani, R. [1995]: Clique partitions, graph compression and speeding-up algorithms. Journal of Computer and System Sciences 51 (1995), 261–272

    Article  MathSciNet  Google Scholar 

  • Frank, A. [1993]: Conservative weightings and ear-decompositions of graphs. Combinatorica 13 (1993), 65–81

    Google Scholar 

  • Fremuth-Paeger, C., und Jungnickel, D. [2003]: Balanced network flows VIII: a revised theory of phase-ordered algorithms and the \( O\left( {\sqrt {nm} \,\text{log}\left( {n^{2} /m} \right)/\,\log \,n} \right) \) bound for the nonbipartite cardinality matching problem. Networks 41 (2003), 137–142

    Article  MathSciNet  Google Scholar 

  • Frobenius, G. [1917]: Über zerlegbare Determinanten. Sitzungsbericht der Königlich Preussischen Akademie der Wissenschaften XVIII (1917), 274–277

    Google Scholar 

  • Fulkerson, D.R. [1956]: Note on Dilworth’s decomposition theorem for partially ordered sets. Proceedings of the AMS 7 (1956), 701–702

    MathSciNet  MATH  Google Scholar 

  • Gallai, T. [1959]: Über extreme Punkt- und Kantenmengen. Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae; Sectio Mathematica 2 (1959), 133–138

    Google Scholar 

  • Gallai, T. [1964]: Maximale Systeme unabhängiger Kanten. Magyar Tudományos Akadémia; Matematikai Kutató Intézetének Közleményei 9 (1964), 401–413

    Google Scholar 

  • Geelen, J.F. [2000]: An algebraic matching algorithm. Combinatorica 20 (2000), 61–70

    Article  MathSciNet  Google Scholar 

  • Geelen, J. und Iwata, S. [2005]: Matroid matching via mixed skew-symmetric matrices. Combinatorica 25 (2005), 187–215

    Article  MathSciNet  Google Scholar 

  • Goldberg, A.V., und Karzanov, A.V. [2004]: Maximum skew-symmetric flows and matchings. Mathematical Programming A 100 (2004), 537–568

    Google Scholar 

  • Hall, P. [1935]: On representatives of subsets. Journal of the London Mathematical Society 10 (1935), 26–30

    Article  Google Scholar 

  • Halmos, P.R., und Vaughan, H.E. [1950]: The marriage problem. American Journal of Mathematics 72 (1950), 214–215

    Article  MathSciNet  Google Scholar 

  • Hopcroft, J.E., und Karp, R.M. [1973]: An n5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing 2 (1973), 225–231

    Article  MathSciNet  Google Scholar 

  • Karzanov, A.V. [1973]: Tochnaya otsenka algoritma nakhozhdeniya maksimal’nogo potoka, primenennogo k zadache “o predstavitelyakh’’. In: Voprosy Kibernetiki, Trudy Seminara po Kombinatornoǐ Matematike, Sovetskoe Radio, Moskau, 1973, pp. 66–70 [auf Russisch]

    Google Scholar 

  • König, D. [1916]: Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre. Mathematische Annalen 77 (1916), 453–465

    Google Scholar 

  • König, D. [1931]: Graphs and matrices. Matematikaiés Fizikai Lapok 38 (1931), 116–119 [auf Ungarisch]

    Google Scholar 

  • König, D. [1933]: Über trennende Knotenpunkte in Graphen (nebst Anwendungen auf Determinanten und Matrizen). Acta Litteratum ac Scientiarum Regiae Universitatis Hungaricae Francisco-Josephinae (Szeged). Sectio Scientiarum Mathematicarum 6 (1933), 155–179

    Google Scholar 

  • Kuhn, H.W. [1955]: The Hungarian method for the assignment problem. Naval Research Logistics Quarterly 2 (1955), 83–97

    Article  MathSciNet  Google Scholar 

  • Lovász, L. [1972]: A note on factor-critical graphs. Studia Scientiarum Mathematicarum Hungarica 7 (1972), 279–280

    Google Scholar 

  • Lovász, L. [1979]: On determinants, matchings and random algorithms. In: Fundamentals of Computation Theory (L. Budach, Hrsg.), Akademie-Verlag, Berlin 1979, pp. 565–574

    Google Scholar 

  • Mądry, A. [2013]: Navigating central path with electrical flows: from flows to matchings, and back. Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (2013), 253–262

    Google Scholar 

  • Mendelsohn, N.S., und Dulmage, A.L. [1958]: Some generalizations of the problem of distinct representatives. Canadian Journal of Mathematics 10 (1958), 230–241

    Google Scholar 

  • Micali, S., und Vazirani, V.V. [1980]: An \( O\left( {V^{{{1 \mathord{\left/ {\vphantom {1 2}} \right. \kern-0pt} 2}}} E} \right) \) algorithm for finding maximum matching in general graphs. Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science (1980), 17–27

    Google Scholar 

  • Mucha, M., und Sankowski, P. [2004]: Maximum matchings via Gaussian elimination. Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (2004), 248–255

    Google Scholar 

  • Mulmuley, K., Vazirani, U.V., und Vazirani, V.V. [1987]: Matching is as easy as matrix inversion. Combinatorica 7 (1987), 105–113

    Article  MathSciNet  Google Scholar 

  • Petersen, J. [1891]: Die Theorie der regulären Graphs. Acta Mathematica 15 (1891), 193–220

    Article  MathSciNet  Google Scholar 

  • Rabin, M.O., und Vazirani, V.V. [1989]: Maximum matchings in general graphs through randomization. Journal of Algorithms 10 (1989), 557–567

    Article  MathSciNet  Google Scholar 

  • Rizzi, R. [1998]: König’s edge coloring theorem without augmenting paths. Journal of Graph Theory 29 (1998), 87

    Google Scholar 

  • Schrijver, A. [1998]: Counting 1-factors in regular bipartite graphs. Journal of Combinatorial Theory B 72 (1998), 122–135

    Article  MathSciNet  Google Scholar 

  • Sperner, E. [1928]: Ein Satz über Untermengen einer endlichen Menge. Mathematische Zeitschrift 27 (1928), 544–548

    Google Scholar 

  • Szegedy, B., und Szegedy, C. [2006]: Symplectic spaces and ear-decomposition of matroids. Combinatorica 26 (2006), 353–377

    Article  MathSciNet  Google Scholar 

  • Szigeti, Z. [1996]: On a matroid defined by ear-decompositions. Combinatorica 16 (1996), 233–241

    Article  MathSciNet  Google Scholar 

  • Tutte, W.T. [1947]: The factorization of linear graphs. Journal of the London Mathematical Society 22 (1947), 107–111

    Article  MathSciNet  Google Scholar 

  • Vazirani, V.V. [1994]: A theory of alternating paths and blossoms for proving correctness of the \( O\left( {\sqrt V E} \right) \) general graph maximum matching algorithm. Combinatorica 14 (1994), 71–109

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Forschungsinstitut für Diskrete Mathematik, Universität Bonn, Bonn, Deutschland

    Bernhard Korte & Jens Vygen

Authors
  1. Bernhard Korte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jens Vygen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bernhard Korte .

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer-Verlag GmbH Deutschland, ein Teil von Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Korte, B., Vygen, J. (2018). Kardinalitätsmaximale Matchings. In: Kombinatorische Optimierung. Masterclass. Springer Spektrum, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-57691-5_10

Download citation

Publish with us

Policies and ethics

Search

Navigation