Year: 2018
Type: preprint
Abstract: We prove that a connected planar graph with $n$ vertices and $n+μ$ edges has a vertex separator of size $O( \sqrtμ + 1)$, and this separator can be computed in linear time.
Source: arXiv (Cornell University)
Authors: Cai, Linda, Har-Peled, Sariel, Ye, Simiao
Institution: University of Illinois Urbana-Champaign
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2885938157