An external memory data structure for shortest path queries (Extended Abstract) (2003)

by David Hutchinson , Anil Maheshwari , Norbert Zeh
Citations:25 - 8 self

Active Bibliography

1 I/O-Optimal Algorithms for Outerplanar Graphs – Anil Maheshwari, Norbert Zeh - 2001
11 An External-Memory Data Structure for Shortest Path Queries – David Hutchinson, Anil Maheshwari, Norbert Zeh - 1999
218 Approximate distance oracles – Mikkel Thorup, Uri Zwick
26 Randomized External-Memory Algorithms for Some Geometric Problems – A. Crauser, P. Ferragina, K. Mehlhorn, U. Meyer, E. Ramos - 2001
1 External Data Structures for Shortest Path Queries on Planar Digraphs – Lars Arge, Laura Toma
16 I/O-Efficient Algorithms for Shortest Path Related Problems – Norbert Ralf Zeh - 2002
15 I/O-efficient algorithms for graphs of bounded treewidth – Anil Maheshwari, Norbert Zeh - 2001
11 Bulk Synchronous Parallel Algorithms for the External Memory Model – Frank Dehne, Wolfgang Dittrich, David Hutchinson, Anil Maheshwari - 2002
11 Reducing i/o complexity by simulating coarse grained parallel algorithms – Frank Dehne, David Hutchinson, Anil Maheshwari, Wolfgang Dittrich - 1999