A computational study of external-memory BFS algorithms

DOI10.1145/1109557.1109623zbMath1192.68937OpenAlexW4237050465MaRDI QIDQ3581501

Ulrich Meyer, Roman Dementiev, Deepak Ajwani

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10197/9914

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85) Computer system organization (68M99)

Related Items (3)

Design and Engineering of External Memory Traversal Algorithms for General Graphs ⋮ Via Detours to I/O-Efficient Shortest Paths ⋮ Processing Huge Graphs with Stxxl

Uses Software

• TPIE
• STXXL

This page was built for publication: A computational study of external-memory BFS algorithms