I/O-Efficient Algorithms on Near-Planar Graphs


Obtaining I/O-efficient algorithms for basic graph problems on sparse directed graphs has been a long-standing open problem. The best known algorithms for most basic problems on such graphs still require Ω(V ) I/Os in the worst case, where V is the number of vertices in the graph. Nevertheless optimal O(sort(V )) I/O algorithms are known for special classes… (More)
DOI: 10.1007/11682462_54


6 Figures and Tables

Cite this paper

@article{Haverkort2006IOEfficientAO, title={I/O-Efficient Algorithms on Near-Planar Graphs}, author={Herman J. Haverkort and Laura Toma}, journal={J. Graph Algorithms Appl.}, year={2006}, volume={15}, pages={503-532} }