A method for obtaining small regular bipartite graphs of girth 8.

Camino Balbuena

Published in: Discret. Math. Theor. Comput. Sci. (2009)

Keyphrases

search engine
information retrieval
web pages
similarity measure
pairwise
clustering method
bipartite graph
objective function
minimum spanning tree
mutual reinforcement
hits algorithm