101 citations · 240 across the 32 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018★ 1 cited
Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time
David Eppstein, Bruce Reed
We consider decomposing a 3-connected planar graph using laminar separators of size three. We show how to find a maximal set of laminar 3-separators in such a graph in linear t…
cs.DS2015★ 1 cited
Connectivity Preserving Iterative Compaction and Finding 2 Disjoint Rooted Paths in Linear Time
Ken-ichi Kawarabayashi, Zhentao Li, Bruce Reed
In this paper we show how to combine two algorithmic techniques to obtain linear time algorithms for various optimization problems on graphs, and present a subroutine which will be…