Bestimmung eines maximalen Matching in beliebigen Graphen
- 1 September 1972
- journal article
- Published by Springer Nature in Computing
- Vol. 9 (3) , 251-257
- https://doi.org/10.1007/bf02246734
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock ProblemCanadian Journal of Mathematics, 1957
- Variants of the hungarian method for assignment problemsNaval Research Logistics Quarterly, 1956