Login / Signup
Weakly bipartite graphs and the Max-cut problem.
Martin Grötschel
William R. Pulleyblank
Published in:
Oper. Res. Lett. (1981)
Keyphrases
</>
bipartite graph
graph model
maximum matching
max cut
graph clustering
cross entropy
maximum cardinality
link prediction
minimum weight
bipartite graph matching
maximum weight
helmholtz principle
random graphs
bipartite networks
mutual reinforcement
reinforcement learning
hits algorithm
edge weights
np complete