On the max-cut of sparse random graphs.

David Gamarnik Quan Li

Published in: Random Struct. Algorithms (2018)

Keyphrases

random graphs
max cut
graph theoretic
phase transition
np complete problems
graph model
planar graphs
undirected graph
np hard
high dimensional
graph partitioning
spectral graph
complex networks
small world
multiscale
ranking algorithm