View source for Klein (section 5) (Planar Bipartite Graph Perfect Matching Maximum Cardinality Matching)

== Time Complexity == 

$O(V^{({4}/{3})$} logV)

== Space Complexity == 

$O(V^{({4}/{3})$})? words

(Considers and operates on a graph partition (which still takes up $O(E)=O(V)$ space), and computes shortest-path distances within each graph partition, the total of which requires $O(V^{(4/3)})$ space)

== Description == 



== Approximate? == 

Exact

== Randomized? == 

No, deterministic

== Model of Computation == 

Word RAM

== Year == 

1997

== Reference == 

http://theory.stanford.edu/~virgi/cs267/papers/planar-sssp.pdf