Engineering planar separator algorithms

  • Authors:

  • Martin Holzer;Frank Schulz;Dorothea Wagner;Grigorios Prasinos;Christos Zaroliagis

  • Affiliations:

  • KIT, Universität Karlsruhe (TH), Karlsruhe, Germany;KIT, Universität Karlsruhe (TH), Karlsruhe, Germany;KIT, Universität Karlsruhe (TH), Karlsruhe, Germany;CTI & University of Patras, Patras, Greece;CTI & University of Patras, Patras, Greece

  • Venue:
  • Journal of Experimental Algorithmics (JEA)
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider classical linear-time planar separator algorithms, determining for a given planar graph a small subset of its nodes whose removal divides the graph into two components of similar size. These algorithms are based on planar separator theorems, which guarantee separators of size O(&sqrt;n) and remaining components of size at most 2n/3 (where n denotes the number of nodes in the graph). In this article, we present a comprehensive experimental study of the classical algorithms applied to a large variety of graphs, where our main goal is to find separators that do not only satisfy upper bounds, but also possess other desirable characteristics with respect to separator size and component balance. We achieve this by investigating a number of specific alternatives for the concrete implementation and fine-tuning of certain parts of the classical algorithms. It is also shown that the choice of several parameters influences the separation quality considerably. Moreover, we propose as planar separators the usage of fundamental cycles, whose size is at most twice the diameter of the graph: For graphs of small diameter, the guaranteed bound is better than the O(&sqrt;n) bounds, and it turns out that this simple strategy almost always outperforms the other algorithms, even for graphs with large diameter.