Space Efficient Separator Algorithms for Planar Graphs
- 20 February 2020
- book chapter
- Published by Springer Nature
- p. 15-21
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A Space-Efficient Separator Algorithm for Planar GraphsIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2019
- $\widetilde{O}(\sqrt{n})$ -Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability2014
- Undirected connectivity in log-spaceJournal of the ACM, 2008
- The complexity of planarity testingInformation and Computation, 2004
- A parallel algorithm for finding a separator in planar graphs1987
- Finding small simple cycle separators for 2-connected planar graphsJournal of Computer and System Sciences, 1986
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979