Counting Hamiltonian cycles in bipartite graphs.

Harri Haanpää Patric R. J. Östergård

Published in: Math. Comput. (2014)

Keyphrases

bipartite graph
maximum matching
graph model
link prediction
bipartite graph matching
maximum weight
maximum cardinality
graph clustering
minimum weight
edge weights
data sets
pairwise
learning process
np hard