Login / Signup
A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs.
Ariful Azad
Aydin Buluç
Xiaoye S. Li
Xinliang Wang
Johannes Langguth
Published in:
SIAM J. Sci. Comput. (2020)
Keyphrases
</>
bipartite graph
maximum matching
maximum cardinality
matching algorithm
computational complexity
learning algorithm
search space
dynamic programming
image matching
parallel implementation
objective function
bipartite graph matching
np hard
greedy heuristic
minimum weight
maximum weight
multiprocessor systems