Skip to main content
SpringerLink
Log in

Maximum matching of given weight in complete and complete bipartite graphs

  • Published:
Cybernetics Aims and scope

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Literature Cited

  1. J. Edmonds and E. L. Johnson, “Matching: A Well-Solved Class of Integer Linear Programs,” in: Combinatorial Structures and Their Applications, Gordon and Breach, New York (1970), pp. 89–92.

    Google Scholar 

  2. M. Gary and D. Johnson, Computers and Intractability [Russian translation], Mir, Moscow (1982).

    Google Scholar 

  3. L. G. Khachiyan, “Matchings of given weight in bipartite graphs,” in: Methods and Programs for the Solution of Optimization Problems on Graphs and Networks, abstracts of papers at the 3rd All-Union Conf. (Aug. 1984, Tashkent) [in Russian], Part 2, VTs SO AN SSSR (1984).

  4. O. Ore, Theory of Graphs, Am. Math. Soc. (1974).

  5. A. V. Karzanov, “An exact bound for the maximum flow algorithm applied to the problem of set representatives,” Voprosy Kibernetiki, No. 1, 66–70 (1973).

    Google Scholar 

  6. J. E. Hopcroft and R. M. Karp, “An n5/2 algorithm for maximum matching in bipartite graphs,” SIAM J. Comput.,2, 225–231 (1973).

    Google Scholar 

  7. G. M. Adel'son-Vel'skii, E. A. Dinits, and A. V. Karzanov, Flow Algorithms [in Russian], Nauka, Moscow (1975).

    Google Scholar 

  8. S. Even and O. Kariv, “An O(n2.5) algorithm for maximum matching in general graphs,” IEEE 16th Ann. Symp. on Foundations of Computer Sci., Conf. record, IEEE, New York (1975) pp. 100–112.

  9. A. V. Karzanov, “Efficient implementations of Edmonds's algorithm to find matchings of maximum cardinality and maximum weight,” in: Studies in Discrete Optimization [in Russian], A. A. Fridman (ed.), Nauka, Moscow (1976).

    Google Scholar 

  10. H. N. Gabow, “An efficient implementation of Edmonds's algorithm for maximum matching on graphs,” J. ASM,23, 221–234 (1976).

    Google Scholar 

Download references

Authors
  1. A. V. Karzanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 7–11, January–February, 1987.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Karzanov, A.V. Maximum matching of given weight in complete and complete bipartite graphs. Cybern Syst Anal 23, 8–13 (1987). https://doi.org/10.1007/BF01068796

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation