The minimal cost maximum matching of a graph (supplementary remarks)
Abhandlungen
Received:
- 24 Downloads
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.
Keywords
Minimal Cost Assignment Problem Match Problem Preceding Paper Maximum Match
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
Preview
Unable to display preview. Download preview PDF.
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
Copyright information
© Physica-Verlag 1971