Finding short cycles in planar graphs using separators
- 1 September 1986
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 7 (3) , 382-394
- https://doi.org/10.1016/0196-6774(86)90029-5
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Arboricity and Subgraph Listing AlgorithmsSIAM Journal on Computing, 1985
- The complexity of determining a shortest cycle of even lengthComputing, 1983
- Smallest-last ordering and clustering and graph coloring algorithmsJournal of the ACM, 1983
- Weakly bipartite graphs and the Max-cut problemOperations Research 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