Login / Signup
A Faster Algorithm for Max Cut in Dense Graphs.
Arijit Ghosh
Gopinath Mishra
Rahul Raychaudhury
Sayantan Sen
Published in:
CoRR (2021)
Keyphrases
</>
max cut
graph model
graph partitioning
graph structure
similarity measure
k means
np hard
optimization algorithm
min max
objective function
optimal solution
probabilistic model
combinatorial optimization
randomly generated
planar graphs