Pages that link to "Item:Q4435346"
From MaRDI portal
The following pages link to On External-Memory Planar Depth First Search (Q4435346):
Displaying 7 items.
- I/O-efficient algorithms for graphs of bounded treewidth (Q834592) (← links)
- External-memory depth-first search algorithm for solid grid graphs (Q835024) (← links)
- An external-memory depth-first search algorithm for general grid graphs (Q1022598) (← links)
- Planar graph blocking for external searching (Q1849382) (← links)
- Via Detours to I/O-Efficient Shortest Paths (Q3644724) (← links)
- Algorithm Theory - SWAT 2004 (Q5315400) (← links)
- Certifying induced subgraphs in large graphs (Q6636998) (← links)