This item is non-discoverable
Approximating sparsest cut in low-treewidth graphs via combinatorial diameter
Citation Link: https://doi.org/10.15480/882.4142
Publikationstyp
Preprint
Date Issued
2021
Sprache
English
Institut
TORE-DOI
DDC Class
510: Mathematik
Funding Organisations