Finding All Leftmost Separators of Size $\le k$

Mahdi Belbasi, Martin Fürer

We define a notion called leftmost separator of size at most $k$. A leftmost separator of size $k$ is a minimal separator $S$ that separates two given sets of vertices $X$ and $Y$…