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 />
U makes a bid<br />
v<br />
u<br />
5<br />
6<br />
7<br />
4<br />
4<br />
0<br />
Profit = 7 − 2 ∗ (1 + ǫ)<br />
Profit = 4<br />
Johannes Langguth <strong>Sequential</strong> <strong>and</strong> <strong>parallel</strong> <strong>algorithms</strong> <strong>for</strong> <strong>bipartite</strong> <strong>matching</strong>