Flow-Optimal Separators for Minor-Free and Induced-Minor-Free Graphs in Linear Time via Follow the Regularized Leader
cs.DS
Submitted: 2026-11-03
Updated: 2026-11-03
Project page: https://lucatrevisan.github.io/40391/lecture12.pdf
Terminology
Sources
- K h-Minor-Free Graphs Have Balanced Separators of Size O(h sqrt n)
- Fast Approximation Algorithms for Balanced Edge and Vertex Separators
- A Separator for Minor-Free Graphs Beyond the Flow Barrier
- Online Learning: A Modern Introduction Using Convex Optimization
- Reweighted Spectral Partitioning Works: A Simple Algorithm for Vertex Separators in Special Graph Classes
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time