The following pages link to I/O-Efficient Planar Separators (Q3631891):
Displaying 8 items.
- Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os (Q1741853) (← links)
- I/O-efficient well-separated pair decomposition and applications (Q2505500) (← links)
- On external-memory MST, SSSP and multi-way planar graph separation (Q3159489) (← links)
- Via Detours to I/O-Efficient Shortest Paths (Q3644724) (← links)
- On External-Memory Planar Depth First Search (Q4435346) (← links)
- An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications (Q4585060) (← links)
- Algorithm Theory - SWAT 2004 (Q5315400) (← links)
- I/O-efficient algorithms on near-planar graphs (Q5891342) (← links)