Sequential and parallel algorithms for bipartite matching
Sequential and parallel algorithms for bipartite matching
Sequential and parallel algorithms for bipartite matching
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Outline Introduction Bipartite Matching Parallel Matching Algorithms 2D Partitioning Parallel Algorithm Weighted Bipartit<br />
Augmenting Path Based Algorithms<br />
Hopcroft-Karp Algorithm ’73<br />
Maximal set of shortest disjoint augmenting paths.<br />
Uses BFS + DFS<br />
Running time: O(m √ n)<br />
Pothen-Fan Algorithm ’90<br />
Maximal set of disjoint augmenting paths.<br />
Uses DFS only<br />
Running time: O(mn)<br />
Fairness makes DFS more stable<br />
Approx. 3 times faster<br />
Johannes Langguth <strong>Sequential</strong> <strong>and</strong> <strong>parallel</strong> <strong>algorithms</strong> <strong>for</strong> <strong>bipartite</strong> <strong>matching</strong>