Planar Separators and Parallel Polygon Triangulation

• Published in: Journal of computer and system sciences Vol. 51; no. 3; pp. 374 - 389
• Main Author: Goodrich, M.T.
• Format: Journal Article Conference Proceeding
• Language: English
• Published: Brugge Elsevier Inc 01.12.1995; Academic Press
• Subjects: Algorithmics. Computability. Computer arithmetics; Applied sciences; Computer science; control theory; systems; Exact sciences and technology; Information retrieval. Graph; Theoretical computing; Design; Graph decomposition; Parallel algorithm; Triangulation; Planar graph; Subgraph; Separator

We show how to construct an O(√ n)-separator decomposition of a planar graph G in O( n) time. Such a decomposition defines a binary tree, where each node corresponds to a subgraph of G and stores an O(√ n)-separator of that subgraph. We also show how to construct an O( n ϵ)-way decomposition tree in...