Some matching problems
- 1 January 1977
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 258-268
- https://doi.org/10.1007/3-540-08342-1_20
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Finding a minimum circuit in a graphPublished by Association for Computing Machinery (ACM) ,1977
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976
- Analysis of biomedical images using maximal matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1976
- A Shortest Path Algorithm for Edge-Sparse GraphsJournal of the ACM, 1976
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Flows in NetworksPublished by Walter de Gruyter GmbH ,1963
- A note on two problems in connexion with graphsNumerische Mathematik, 1959