Skip to main content
SpringerLink
Log in

The minimal cost maximum matching of a graph (supplementary remarks)

  • Abhandlungen
  • Published:
Unternehmensforschung Aims and scope Submit manuscript

Summary

In addition to the preceding paper, it will be shown that (1) the matching problem is closely related to the linear assignment problem and how (2) this property can be taken advantage of for solving the matching problem.

Zusammenfassung

In Ergänzung zum vorhergehenden Beitrag wird gezeigt, daß das Matching Problem eng mit dem linearen Zuordnungsproblem verwandt ist und wie diese Tatsache zur Lösung des Matching Problems genutzt werden kann.

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

Access this article

Log in via an institution

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

  • De Maio, A. O. andC. A. Roveda: The Minimal Cost Maximum Matching of a Graph, Unternehmensforschung15, 1971, 196–210.

    Google Scholar 

  • Edmonds, J.: Maximum Matching and a Polyhedron With 0,1-Vertices, J. Res. Nat. Bur. Stand.,68 B, 1965, 125–130.

    Google Scholar 

  • Müller-Merbach, H.: Optimale Reihenfolgen, Springer, Berlin-Heidelberg-New York 1970.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Betriebswirtschaftslehre, Johannes Gutenberg-Universität, Binger Str. 22, 65 Mainz

    H. Müller-Merbach

Authors
  1. H. Müller-Merbach
    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

Müller-Merbach, H. The minimal cost maximum matching of a graph (supplementary remarks). Unternehmensforschung Operations Research 15, 211–213 (1971). https://doi.org/10.1007/BF01939828

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation