Unique Maximum Matching Algorithms
- 31 August 2001
- journal article
- Published by Elsevier BV in Journal of Algorithms
- Vol. 40 (2), 159-183
- https://doi.org/10.1006/jagm.2001.1167
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Unique Maximum Matching AlgorithmsJournal of Algorithms, 2001
- Decremental 2- and 3-connectivity on planar graphsAlgorithmica, 1996
- Faster scaling algorithms for general graph matching problemsJournal of the ACM, 1991
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- A scaling algorithm for weighted matching on general graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- An analysis of alternative strategies for implementing matching algorithmsNetworks, 1983
- An efficient reduction technique for degree-constrained subgraph and bidirected network flow problemsPublished by Association for Computing Machinery (ACM) ,1983
- Algorithmic proofs of two relations between connectivity and the 1-factors of a graphDiscrete Mathematics, 1979
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965