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
Tag: Manual revert
 
Line 1: Line 1:
== Time Complexity ==  
== Time Complexity ==  


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


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


words
$O(m)$ words


()
(https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.5555/320176.320229)


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


1974
1990


== Reference ==  
== Reference ==  


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

Latest revision as of 09:42, 28 April 2023

Time Complexity

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

Space Complexity

$O(m)$ words

(https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.5555/320176.320229)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1990

Reference

https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.5555/320176.320229