Pages that link to "Item:Q1861568"
From MaRDI portal
The following pages link to An external memory data structure for shortest path queries (Q1861568):
Displayed 7 items.
- I/O-efficient algorithms for computing planar geometric spanners (Q929749) (← links)
- An external-memory depth-first search algorithm for general grid graphs (Q1022598) (← links)
- An external memory data structure for shortest path queries (Q1861568) (← links)
- Data structures for categorical path counting queries (Q2089697) (← 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)
- (Q5743390) (← links)