Some Matching Problems for Bipartite Graphs
- 1 October 1978
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 25 (4) , 517-525
- https://doi.org/10.1145/322092.322093
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Finding a minimum circuit in a graphPublished by Association for Computing Machinery (ACM) ,1977
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on GraphsJournal of the ACM, 1976
- A Shortest Path Algorithm for Edge-Sparse GraphsJournal of the ACM, 1976
- A O(|V|·|E|) algorithm for maximum matching of graphsComputing, 1974
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Flows in NetworksPublished by Walter de Gruyter GmbH ,1963
- Combinatorial MathematicsPublished by American Mathematical Society (AMS) ,1963
- A note on two problems in connexion with graphsNumerische Mathematik, 1959