Abstract
We present external memory algorithms for outerplanarity testing, embedding outerplanar graphs, breadth-first search (BFS) and depth-first search (DFS) in outerplanar graphs, and finding a2-separator of size 2 for a given outerplanar graph. Our algorithms take O(sort(N)) I/Os and can easily be improved to take O (perm (N)) I/Os, as all these problems have linear time solutions in internal memory. For BFS, DFS, and outerplanar embedding we show matching lower bounds.
Cite
CITATION STYLE
Maheshwari, A., & Zeh, N. (1999). External memory algorithms for outerplanar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1741, pp. 307–316). Springer Verlag. https://doi.org/10.1007/3-540-46632-0_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
