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 Solution Relaxed Global Relabeling 1 Perform global relabeling BFS on each processor 2 Search “jumps” one processor per round Johannes Langguth Sequential and parallel algorithms for bipartite matching

Outline Introduction Bipartite Matching Parallel Matching Algorithms 2D Partitioning Parallel Algorithm Weighted Bipartit Global Relabeling Round 1 2 0 1 1 1 Johannes Langguth Sequential and parallel algorithms for bipartite matching

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

Global Relabeling Round 1<br />

2<br />

0<br />

1<br />

1<br />

1<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!