An implementation of I/O-efficient dynamic breadth-first search using level-aligned hierarchical clustering

DOI10.1007/978-3-642-40450-4_11MaRDI QIDQ2849304zbMATH OpenOpenAlexFDO

Authors Andreas Beckmann, Ulrich Meyer, David Veith

Publication date 17 September 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40450-4_11

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On dynamic breadth-first search in external-memory
• scientific article; zbMATH DE number 1947435
• Improved external memory BFS implementations
• scientific article; zbMATH DE number 5734730
• scientific article; zbMATH DE number 1445387

Cited in

(2)

• On dynamic breadth-first search in external-memory
• Hierarchical Heavy Hitters with the Space Saving Algorithm

This page was built for publication: An implementation of I/O-efficient dynamic breadth-first search using level-aligned hierarchical clustering

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