Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chalermsook, Parinya, Kaul, Matthias, Mnich, Matthias, Spoerhase, Joachim, Uniyal, Sumedha, Vaz, Daniel
Format:	Preprint
Published:	2021
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2111.06299