Login / Signup
Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer-Dimer Entropy.
Shmuel Friedland
Leonid Gurvits
Published in:
Comb. Probab. Comput. (2008)
Keyphrases
</>
bipartite graph
lower bound
maximum cardinality
upper bound
maximum matching
minimum weight
objective function
branch and bound
branch and bound algorithm
np hard
link prediction
graph clustering
worst case
maximum weight
mutual reinforcement
optimal solution
hits algorithm
affinity graph
data sets