Heuristic matching for graphs satisfying the triangle inequality
- 30 June 1984
- journal article
- Published by Elsevier BV in Journal of Algorithms
- Vol. 5 (2), 163-179
- https://doi.org/10.1016/0196-6774(84)90024-5
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on GraphsJournal of the ACM, 1976
- A note on two problems in connexion with graphsNumerische Mathematik, 1959