A Simple Algorithm for Computing a Cycle Separator
Computational Geometry
2018-01-19 v2 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.1709.08122,
title = {A Simple Algorithm for Computing a Cycle Separator},
author = {Sariel Har-Peled and Amir Nayyeri},
journal= {arXiv preprint arXiv:1709.08122},
year = {2018}
}