New hardness results for planar graph problems in p and an algorithm for sparsest cut.

Amir Abboud Vincent Cohen-Addad Philip N. Klein

Published in: STOC (2020)

Keyphrases

planar graphs
computational complexity
np hard
dynamic programming
worst case
optimal solution
k means
image segmentation
monte carlo