A Sublinear Time Tester for Max-Cut on Clusterable Graphs.

Agastya Vibhuti Jha Akash Kumar

Published in: ICALP (2024)

Keyphrases

max cut
graph model
planar graphs
graph partitioning
np hard
spectral graph
np complete problems
np complete
shortest path
approximation algorithms
min max