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 />
Weighted Matching Algorithms<br />
Exact Weighted Bipartite Algorithms<br />
Special case of Minimum Cost Flow<br />
Must find weight augmenting paths<br />
Can be solved using Shortest Path Algorithms<br />
Running time: O(n 3 )<br />
Approximate Weighted Bipartite Algorithms<br />
Parallel 1/2 approximation: Bisseling Manne ’07<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