Login / Signup
Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter.
Parinya Chalermsook
Matthias Kaul
Matthias Mnich
Joachim Spoerhase
Sumedha Uniyal
Daniel Vaz
Published in:
CoRR (2021)
Keyphrases
</>
bounded treewidth
search space
upper bound
np complete
average degree
graph matching
boolean functions
graph theory
graph structure
constraint graph
directed graph
space complexity
graph representation
worst case
highly correlated