Sequential and parallel algorithms for bipartite matching

Sequential and parallel algorithms for bipartite matching Sequential and parallel algorithms for bipartite matching

10.08.2013 Views

Outline Introduction Bipartite Matching Parallel Matching Algorithms 2D Partitioning Parallel Algorithm Weighted Bipartit Final Matching 5 3 1 3 3 4 6 2 4 2 Johannes Langguth Sequential and parallel algorithms for bipartite matching

Outline Introduction Bipartite Matching Parallel Matching Algorithms 2D Partitioning Parallel Algorithm Weighted Bipartit Push-Relabel Based Algorithms Global relabelings Use BFS from unmatched vertices Running time: O(m √ n) One global relabeling per O(n) Actual frequency heavily affects performance Push order: Johannes Langguth Sequential and parallel algorithms for bipartite matching

Outline Introduction Bipartite Matching Parallel Matching Algorithms 2D Partitioning Parallel Algorithm Weighted Bipartit<br />

Final Matching<br />

5<br />

3<br />

1<br />

3<br />

3<br />

4<br />

6<br />

2<br />

4<br />

2<br />

Johannes Langguth <strong>Sequential</strong> <strong>and</strong> <strong>parallel</strong> <strong>algorithms</strong> <strong>for</strong> <strong>bipartite</strong> <strong>matching</strong>

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!