I/O-Efficient Planar Separators

We present I/O-efficient algorithms for computing optimal separator partitions of planar graphs. Our main result shows that, given a planar graph $G$ with $N$ vertices and an integer $r > 0$, a vertex separator of size O$(N / \sqrt{r})$ that partitions $G$ into O$(N / r)$ subgraphs of size at mos...

Full description

Bibliographic Details

Published in:	SIAM journal on computing Vol. 38; no. 3; pp. 767 - 801
Main Authors:	Maheshwari, Anil, Zeh, Norbert
Format:	Journal Article
Language:	English
Published:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2008
Subjects:	Algorithms Computer science Connectivity Geographic information systems Graphs
ISSN:	0097-5397, 1095-7111
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!