A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
I/O-Optimal Algorithms for Outerplanar Graphs
[chapter]
2006
Graph Algorithms and Applications 5
We present linear-I/O algorithms for fundamental graph problems on embedded outerplanar graphs. We show that breadth-first search, depth-first search, single-source shortest paths, triangulation, and computing anseparator of size O(1/ ) take O(scan(N )) I/Os on embedded outerplanar graphs. We also show that it takes O(sort(N )) I/Os to test whether a given graph is outerplanar and to compute an outerplanar embedding of an outerplanar graph, thereby providing O(sort(N ))-I/O algorithms for the
doi:10.1142/9789812773289_0005
fatcat:umf5ff7saba3dejo7sf4qcrvoq