Login / Signup
Local algorithms for Maximum Cut and Minimum Bisection on locally treelike regular graphs of large degree.
Ahmed El Alaoui
Andrea Montanari
Mark Sellke
Published in:
CoRR (2021)
Keyphrases
</>
learning algorithm
computational cost
planar graphs
computational complexity
significant improvement
data mining techniques
times faster
graph theory
objective function
graph matching
bipartite graph
graph theoretic
maximal cliques