Gabow (general Maximum-weight matching): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
Tags: Manual revert Reverted
No edit summary
Tags: Manual revert Reverted
Line 1: Line 1:
== Time Complexity ==  
== Time Complexity ==  


$O(mn+n^{2}log(n)$)
$O(n^{3})$


== Space Complexity ==  
== Space Complexity ==  


$O(m)$ words
words


(https://dl.acm.org/doi/10.5555/320176.320229)
()


== Description ==  
== Description ==  
Line 27: Line 27:
== Year ==  
== Year ==  


1990
1974


== Reference ==  
== Reference ==  


https://dl.acm.org/doi/10.5555/320176.320229
https://www.proquest.com/docview/287948024?pq-origsite=gscholar&fromopenview=true

Revision as of 10:42, 28 April 2023

Time Complexity

$O(n^{3})$

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1974

Reference

https://www.proquest.com/docview/287948024?pq-origsite=gscholar&fromopenview=true