Pages that link to "Item:Q3581501"
From MaRDI portal
The following pages link to A computational study of external-memory BFS algorithms (Q3581501):
Displaying 6 items.
- Traversing graphs in a paging environment, BFS or DFS? (Q751281) (← links)
- An effective and efficient MapReduce algorithm for computing BFS-based traversals of large-scale RDF graphs (Q1736757) (← links)
- External memory BFS on undirected graphs with bounded degree. (Q2768276) (← links)
- Processing Huge Graphs with Stxxl (Q3439465) (← links)
- Design and Engineering of External Memory Traversal Algorithms for General Graphs (Q3637309) (← links)
- Via Detours to I/O-Efficient Shortest Paths (Q3644724) (← links)