Pages that link to "Item:Q1920428"
From MaRDI portal
The following pages link to Blocking for external graph searching (Q1920428):
Displaying 11 items.
- I/O-efficient path traversal in succinct planar graphs (Q521807) (← links)
- Optimal cache-oblivious mesh layouts (Q633762) (← links)
- Data replication in static tree structures (Q1007601) (← links)
- Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep (Q1384210) (← links)
- Paging more than one page (Q1391298) (← links)
- An external memory data structure for shortest path queries (Q1861568) (← links)
- Worst-case optimal tree layout in external memory (Q2354018) (← links)
- Succinct and I/O efficient data structures for traversal in trees (Q2429347) (← links)
- An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications (Q4585060) (← links)
- Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep (Q5057447) (← links)
- Topology B-trees and their applications (Q5057450) (← links)
