Large graphs arise naturally in many real world applications. The actual performance of simple RAM model algorithms for traversing these graphs (stored in external memory) deviates significantly from their linear or near-linear predicted performance because of the large number of I/Os they incur. In order to alleviate the I/O bottleneck, many external memory graph traversal algorithms have been designed with provable worst-case guarantees. We describe the various techniques used in the design and engineering of such algorithms and survey the state-of-the-art in I/O-efficient graph traversal algorithms. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Ajwani, D., & Meyer, U. (2009). Design and engineering of external memory traversal algorithms for general graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5515 LNCS, pp. 1–33). https://doi.org/10.1007/978-3-642-02094-0_1
Mendeley helps you to discover research relevant for your work.