Edmonds (Maximum-Weight Matching Maximum-Weight Matching)
Jump to navigation
Jump to search
Time Complexity
$O(mn^{2})$
Space Complexity
$O(mn^{2})$?? words
(At worst, keeps track of the entire sequence of graphs created; it's possible this can be improved?)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1965
Reference
https://nvlpubs.nist.gov/nistpubs/jres/69B/jresv69Bn1-2p125_A1b.pdf