An improved algorithm for the planar 3-cut problem
- 31 March 1991
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 12 (1) , 23-37
- https://doi.org/10.1016/0196-6774(91)90021-p
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Finding short cycles in planar graphs using separatorsJournal of Algorithms, 1986
- Finding small simple cycle separators for 2-connected planar graphsJournal of Computer and System Sciences, 1986
- An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut ProblemSIAM Journal on Algebraic Discrete Methods, 1985
- Arboricity and Subgraph Listing AlgorithmsSIAM Journal on Computing, 1985
- The clique problem for planar graphsInformation Processing Letters, 1981
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- Finding a Minimum Circuit in a GraphSIAM Journal on Computing, 1978
- Efficient Planarity TestingJournal of the ACM, 1974