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 />
Bipartite Matching<br />
Bipartite Cardinality Matching<br />
Given an undirected, <strong>bipartite</strong> graph G = (V1,V2,E),E ⊆ V1 × V2<br />
find a maximum subset M ⊆ E of pairwise nonadjacent edges.<br />
Perfect Matching<br />
M is called a perfect <strong>matching</strong> iff |V1| = |V2| = |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>