Prefer a chat interface with context about you and your work?
Structured recursive separator decompositions for planar graphs in linear time
Given a triangulated planar graph G on n vertices and an integer r<n, an r--division of G with few holes is a decomposition of G into O(n/r) regions of size at most r such that each region contains at most a constant number of faces that are not faces of …