Flow-Optimal Separators for Minor-Free and Induced-Minor-Free Graphs in Linear Time via Follow the Regularized LeaderResearch Paper
A balanced vertex separator removes a small set of vertices so that no remaining connected component contains most of the original graph. Such separators allow a graph problem to be divided into smaller instances. Their usefulness depends on both the number of removed vertices and the time spent finding them: a small separator with expensive construction…