A combinatorial algorithm for weighted stable sets in bipartite graphs.

Ulrich Faigle Gereon Frahling

Published in: Discret. Appl. Math. (2006)

Keyphrases

bipartite graph
dynamic programming
bipartite graph matching
learning algorithm
maximum cardinality
search space
np hard
maximum weight
machine learning
optimal solution
k means
co occurrence
clustering method
knapsack problem
graph structure
minimum weight