Finding small simple cycle separators for 2-connected planar graphs
- 1 June 1986
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 32 (3) , 265-279
- https://doi.org/10.1016/0022-0000(86)90030-9
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A separator theorem for graphs of bounded genusJournal of Algorithms, 1984
- On the Problem of Partitioning Planar GraphsSIAM Journal on Algebraic Discrete Methods, 1982
- Parallel Algorithms in Graph Theory: Planarity TestingSIAM Journal on Computing, 1982
- An O(logn) parallel connectivity algorithmJournal of Algorithms, 1982
- Graph algorithmsComputer-Aided Design, 1980
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- Generalized Nested DissectionSIAM Journal on Numerical Analysis, 1979
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Efficient Planarity TestingJournal of the ACM, 1974
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974