Improved external memory BFS implementations

DOI10.1137/1.9781611972870.1MaRDI QIDQ5233490zbMATH OpenOpenAlexFDO

Authors Deepak Ajwani, Ulrich Meyer, Vitaly Osipov

Publication date 11 September 2019

Published in 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 5734730
• A computational study of external-memory BFS algorithms
• scientific article; zbMATH DE number 1947435
• External memory BFS on undirected graphs with bounded degree.
• scientific article; zbMATH DE number 1445387

Cited in

(6)

• External memory BFS on undirected graphs with bounded degree.
• An implementation of I/O-efficient dynamic breadth-first search using level-aligned hierarchical clustering
• A computational study of external-memory BFS algorithms
• scientific article; zbMATH DE number 1947435 (Why is no real title available?)
• scientific article; zbMATH DE number 1445387 (Why is no real title available?)
• Traversing graphs in a paging environment, BFS or DFS?

This page was built for publication: Improved external memory BFS implementations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233490)