Partitioning Planar Graphs
- 1 April 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 21 (2), 203-215
- https://doi.org/10.1137/0221016
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the complexity of embedding planar graphs to minimize certain distance measuresAlgorithmica, 1990
- A parallel algorithm for bisection width in treesComputers & Mathematics with Applications, 1988
- Graph bisection algorithms with good average case behaviorCombinatorica, 1987
- A framework for solving VLSI graph layout problemsJournal of Computer and System Sciences, 1984
- Optimization by Simulated AnnealingScience, 1983
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- Efficient Planarity TestingJournal of the ACM, 1974
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970