A Simple Algorithm for Computing a Cycle Separator
Abstract
We present a linear time algorithm for computing a cycle separator in a planar graph that is (arguably) simpler than previously known algorithms. Our algorithm builds on, and is somewhat similar to, previous algorithms for computing separators. The main new ingredient is a specific layered decomposition of the planar graph constructed differently from previous BFS-based layerings.
- Publication:
-
arXiv e-prints
- Pub Date:
- September 2017
- DOI:
- 10.48550/arXiv.1709.08122
- arXiv:
- arXiv:1709.08122
- Bibcode:
- 2017arXiv170908122H
- Keywords:
-
- Computer Science - Computational Geometry;
- Computer Science - Discrete Mathematics