Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs
Author:
- 1 January 1999
- book chapter
- Published by Springer Nature
- p. 259-269
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Fast Parallel Algorithms for Graph Matching Problems1998
- 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 graphs1980
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973