A Space-Efficient Separator Algorithm for Planar Graphs

Ryo ASHIDA; Sebastian KUHNERT; Osamu WATANABE

doi:10.1587/transfun.E102.A.1007

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Online ISSN : 1745-1337
Print ISSN : 0916-8508

Special Section on Discrete Mathematics and Its Applications

A Space-Efficient Separator Algorithm for Planar Graphs

Ryo ASHIDA, Sebastian KUHNERT, Osamu WATANABE

Author information

Keywords: separator, sublinear-space algorithm

JOURNAL RESTRICTED ACCESS

2019 Volume E102.A Issue 9 Pages 1007-1016

DOI https://doi.org/10.1587/transfun.E102.A.1007

Details

Abstract

Miller [9] proposed a linear-time algorithm for computing small separators for 2-connected planar graphs. We explain his algorithm and present a way to modify it to a space efficient version. Our algorithm can be regarded as a log-space reduction from the separator construction to the breadth first search tree construction.

Content from these authors

Favorites & Alerts

Corresponding author

Register with J-STAGE for free!