论文信息 - A Simple Algorithm for Computing a Cycle Separator

A Simple Algorithm for Computing a Cycle Separator

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.

Amir Nayyeri | Sariel Har-Peled

[1] Gary L. Miller,et al. Separators for sphere-packings and nearest neighbor graphs , 1997, JACM.

[2] Robin Thomas,et al. Planar Separators , 1994, SIAM J. Discret. Math..

[3] Gary L. Miller,et al. Finding small simple cycle separators for 2-connected planar graphs. , 1984, STOC '84.

[4] Gary L. Miller,et al. Finding Small Simple Cycle Separators for 2-Connected Planar Graphs , 1986, J. Comput. Syst. Sci..

[5] Sariel Har-Peled,et al. A Simple Proof of the Existence of a Planar Separator , 2011, ArXiv.

[6] W. T. Tutte. A THEOREM ON PLANAR GRAPHS , 1956 .

[7] R. Tarjan,et al. A Separator Theorem for Planar Graphs , 1977 .

[8] Eli Fox-Epstein,et al. Short and Simple Cycle Separators in Planar Graphs , 2013, ALENEX.

[9] Philip N. Klein,et al. Structured recursive separator decompositions for planar graphs in linear time , 2012, STOC '13.