An efficient algorithm for determining fixed bonds and normal components in a bipartite graph.

Xiaofeng Guo Milan Randic

Published in: Discrete Mathematical Chemistry (1998)

Keyphrases

bipartite graph
dynamic programming
learning algorithm
optimal solution
search space
matching algorithm
maximum matching
graph clustering
np hard
k means
objective function
decision trees
information retrieval systems
clustering method
active learning
knapsack problem
minimum weight