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 />
A New Parallel Algorithm<br />
Ingredients <strong>for</strong> a new Algorithm<br />
1 Maintain locally maximum <strong>matching</strong><br />
2 Find local paths between connectors <strong>and</strong> free left vertices<br />
3 Push free left vertices<br />
4 Use labels to guide pushes<br />
5 Follow at most m/p edges per round to ensure load balancing<br />
6 Apply continous global relabelings to update labels<br />
Challenge<br />
Distributed memory global relabel is inefficient!<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