X-Wim: Massive Parallelization of Weighted Matching in Bipartite Graphs
X-Wim is built on a new phase-decoupled approach that breaks the strong interleaving between algorithmic phases, eliminates frequent global updates, enables concurrent search for multiple disjoint paths, and incorporates an adaptive search strategy, and is the fastest solution for this class of graph algorithms.