Faster scaling algorithms for general graph matching problems
- 1 October 1991
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 38 (4), 815-853
- https://doi.org/10.1145/115234.115366
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Faster Scaling Algorithms for Network ProblemsSIAM Journal on Computing, 1989
- Efficient implementation of graph algorithms using contractionJournal of the ACM, 1989
- Algorithms for two bottleneck optimization problemsJournal of Algorithms, 1988
- Scaling algorithms for network problemsJournal of Computer and System Sciences, 1985
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- A primal algorithm for optimum matchingPublished by Springer Nature ,1978
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on GraphsJournal of the ACM, 1976
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965