Journal of Graph Algorithms and Applications
Even though a large number of I/O-e#cient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-e#cient algorithms are known for depth-first search or breath-first search in sparse graphs. In this paper, we present two new results on I/O-e#cient depth-first search in an important class of sparse graphs, namely undirected embedded planar graphs. We develop a new depth-first search algorithm that uses O(sort(N)log(N/M)) I/Os, and show how planar depth-first search can be reduced to planar breadthfirst search in O(sort(N)) I/Os. As part of the first result, we develop the first I/O-e#cient algorithm for finding a simple cycle separator of an embedded biconnected planar graph. This algorithm uses O(sort(N)) I/Os.
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.