A generalization of Hopcroft-Karp algorithm for semi-matchings and covers in bipartite graphs

Ján Katrenic Gabriel Semanisin

Published in: CoRR (2011)

Keyphrases

bipartite graph
maximum cardinality
k means
dynamic programming
matching algorithm
learning algorithm
computational complexity
search space
np hard
information retrieval
objective function
optimal solution
co occurrence
minimum spanning tree