Edge separators for planar graphs and their applications
- 9 June 2005
- book chapter
- Published by Springer Nature
- p. 280-290
- https://doi.org/10.1007/bfb0017151
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- On mapping parallel algorithms into parallel architecturesJournal of Parallel and Distributed Computing, 1987
- A parallel algorithm for finding a separator in planar graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Embedding Outerplanar Graphs in Small BooksSIAM Journal on Algebraic Discrete Methods, 1987
- Finding small simple cycle separators for 2-connected planar graphsJournal of Computer and System Sciences, 1986
- On the Problem of Partitioning Planar GraphsSIAM Journal on Algebraic Discrete Methods, 1982
- Graphs That are Almost Binary TreesSIAM Journal on Computing, 1982
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- Generalized Nested DissectionSIAM Journal on Numerical Analysis, 1979
- Preserving average proximity in arraysCommunications of the ACM, 1978