Sign in
Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter.
Parinya Chalermsook
Matthias Kaul
Matthias Mnich
Joachim Spoerhase
Sumedha Uniyal
Daniel Vaz
Published in:
ACM Trans. Algorithms (2024)
Keyphrases
</>
bounded treewidth
graph structure
search space
upper bound
np complete
graph matching
graph theory
graph representation
boolean functions
planar graphs
tree decompositions
average degree
graph theoretic
space complexity
graph model
subgraph isomorphism
graph mining
weighted graph
integer programming
search algorithm