Sequential and parallel algorithms for bipartite matching
Sequential and parallel algorithms for bipartite matching
Sequential and parallel algorithms for bipartite matching
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Outline Introduction Bipartite Matching Parallel Matching Algorithms 2D Partitioning Parallel Algorithm Weighted Bipartit<br />
Solution<br />
Relaxed Global Relabeling<br />
1 Per<strong>for</strong>m global relabeling BFS on each processor<br />
2 Search “jumps” one processor per round<br />
3 Labels are no longer lower bounds on graph distance<br />
4 Labels are lower bounds on processor jump distance<br />
5 Maximum number of jumps J is bounded only by n<br />
6 Tedious to prove running time<br />
Running time<br />
O(n(J + r)m)<br />
Johannes Langguth <strong>Sequential</strong> <strong>and</strong> <strong>parallel</strong> <strong>algorithms</strong> <strong>for</strong> <strong>bipartite</strong> <strong>matching</strong>