The following pages link to (Q4411404):
Displaying 12 items.
- Optimal cache-oblivious mesh layouts (Q633762) (← links)
- I/O-efficient algorithms for graphs of bounded treewidth (Q834592) (← links)
- Fast breadth-first search in still less space (Q2301537) (← links)
- On Trade-Offs in External-Memory Diameter-Approximation (Q3512478) (← links)
- Semi-external LTL Model Checking (Q3512515) (← links)
- A computational study of external-memory BFS algorithms (Q3581501) (← links)
- Design and Engineering of External Memory Traversal Algorithms for General Graphs (Q3637309) (← links)
- Via Detours to I/O-Efficient Shortest Paths (Q3644724) (← links)
- An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications (Q4585060) (← links)
- Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy (Q4993299) (← links)
- (Q5743422) (← links)
- Certifying induced subgraphs in large graphs (Q6636998) (← links)