A balanced separator of size O(h √(log h) √n) for K_h-minor-free graphs is constructed by adding low-diameter decompositions to the Alon-Seymour-Thomas iterative framework.
Graph minor theory.Bulletin of the American Mathematical Society, 43(1):75–86, October 2005
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Separator for Minor-Free Graphs Beyond the Flow Barrier
A balanced separator of size O(h √(log h) √n) for K_h-minor-free graphs is constructed by adding low-diameter decompositions to the Alon-Seymour-Thomas iterative framework.