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 />
Push-Relabel Based Algorithms<br />
Global relabelings<br />
Use BFS from unmatched vertices<br />
Running time: O(m √ n)<br />
One global relabeling per O(n)<br />
Actual frequency heavily affects per<strong>for</strong>mance<br />
Push order:<br />
Johannes Langguth <strong>Sequential</strong> <strong>and</strong> <strong>parallel</strong> <strong>algorithms</strong> <strong>for</strong> <strong>bipartite</strong> <strong>matching</strong>
Change language