An algorithm for counting short cycles in bipartite graphs.

Thomas R. Halford Keith M. Chugg

Published in: IEEE Trans. Inf. Theory (2006)

Keyphrases

bipartite graph
search space
dynamic programming
learning algorithm
optimal solution
computational complexity
data sets
clustering method
graph clustering
objective function
k means
np hard
matching algorithm
maximum matching
bipartite graph matching