Gabow, Galil, Spencer (general Maximum-weight matching)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(mn*log(log(log(n)$/log({2}+m/n))) + n^{2}*log(n))

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1989

Reference

https://ieeexplore.ieee.org/abstract/document/715935