Mucha; Sankowski (planar) (Bipartite Graph MCM Maximum Cardinality Matching)

From Algorithm Wiki
Revision as of 11:14, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{(\omega/{2})$}) where omega is the exponent on matrix multiplication == Space Complexity == $O(VlogV)$??? words (Paper mentions matrices with O(VlogV) nonempty entries; unclear if there are any other space-consuming objects (on first passthrough) as planar graphs only require O(V) space) == Description == == Approximate? == Exact == Randomized? == Yes, Monte Carlo == Model of Computation == Word RAM == Year == 2006 == Re...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(V^{(\omega/{2})$}) where omega is the exponent on matrix multiplication

Space Complexity

$O(VlogV)$??? words

(Paper mentions matrices with O(VlogV) nonempty entries; unclear if there are any other space-consuming objects (on first passthrough) as planar graphs only require O(V) space)

Description

Approximate?

Exact

Randomized?

Yes, Monte Carlo

Model of Computation

Word RAM

Year

2006

Reference

https://link.springer.com/article/10.1007/s00453-005-1187-5

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Mucha;_Sankowski_(planar)_(Bipartite_Graph_MCM_Maximum_Cardinality_Matching)&oldid=45254"