An adjustable linear time parallel algorithm for maximum weight bipartite matching.

Morteza Fayyazi David R. Kaeli Waleed Meleis

Published in: Inf. Process. Lett. (2006)

Keyphrases

parallel algorithm
bipartite matching
maximum weight
bipartite graph
minimum weight
partial order
weighted graph
np hard
worst case
parallel version
lower bound
special case
evolutionary algorithm
dynamic programming
upper bound
random walk