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:
FIFO (BFS) : Competitive with Pothen-Fan algorithm
LIFO (DFS) : 20 times slower than FIFO
Lowest Label First : 20% slower than FIFO
Highest Label First : more than 20 times slower than FIFO
Johannes Langguth Sequential and parallel algorithms for bipartite matching