A computational study of external-memory BFS algorithms
From MaRDI portal
Recommendations
- External memory BFS on undirected graphs with bounded degree.
- Improved external memory BFS implementations
- On dynamic breadth-first search in external-memory
- An Experimental Study of External Memory Algorithms for Connected Components
- scientific article; zbMATH DE number 1947435
- Design and Engineering of External Memory Traversal Algorithms for General Graphs
- scientific article; zbMATH DE number 910869
- Analysis of a memory-efficient self-stabilizing BFS spanning tree construction
- An external memory data structure for shortest path queries
- scientific article; zbMATH DE number 1522938
Cited in
(10)- Processing Huge Graphs with Stxxl
- Improved external memory BFS implementations
- An effective and efficient MapReduce algorithm for computing BFS-based traversals of large-scale RDF graphs
- External memory BFS on undirected graphs with bounded degree.
- On Trade-Offs in External-Memory Diameter-Approximation
- Traversing graphs in a paging environment, BFS or DFS?
- scientific article; zbMATH DE number 1947435 (Why is no real title available?)
- scientific article; zbMATH DE number 1445387 (Why is no real title available?)
- Design and Engineering of External Memory Traversal Algorithms for General Graphs
- Via Detours to I/O-Efficient Shortest Paths
This page was built for publication: A computational study of external-memory BFS algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581501)
