Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs
- 1 January 1999
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 259-269
- https://doi.org/10.1007/3-540-49116-3_24
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Fast Parallel Algorithms for Graph Matching ProblemsPublished by Oxford University Press (OUP) ,1998
- Faster scaling algorithms for general graph matching problemsJournal of the ACM, 1991
- A survey of heuristics for the weighted matching problemNetworks, 1983
- An O(v|v| c |E|) algoithm for finding maximum matching in general graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973