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 />
Parallel Algorithm<br />
Push - Relabel approach<br />
Pushes can be per<strong>for</strong>med in any order (Goldberg-Tarjan ’88)<br />
Basic Assumptions<br />
Target architechture: traditional supercomputer<br />
Graph (sparse matrix) is 2D partitioned <strong>and</strong> distributed<br />
Graph usually has a perfect <strong>matching</strong><br />
Instances can be huge<br />
Johannes Langguth <strong>Sequential</strong> <strong>and</strong> <strong>parallel</strong> <strong>algorithms</strong> <strong>for</strong> <strong>bipartite</strong> <strong>matching</strong>