A scaling algorithm for maximum weight matching in bipartite graphs.

Ran Duan Hsin-Hao Su

Published in: SODA (2012)

Keyphrases

bipartite graph
maximum weight
dynamic programming
optimal solution
computational complexity
maximum weight matching
learning algorithm
graphical models
maximum matching
objective function
np hard
graph clustering