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

DOI10.1145/3357713.3384310OpenAlexW3035296211MaRDI QIDQ5144984

Amir Abboud, Vincent Cohen-Addad, Philip N. Klein

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.02377

zbMATH Keywords

algorithmplanar graphssparsest cut

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

On Dasgupta's hierarchical clustering objective and its relation to other graph parameters

This page was built for publication: New hardness results for planar graph problems in p and an algorithm for sparsest cut