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

by David Hutchinson , Anil Maheshwari , Norbert Zeh
Citations:23 - 7 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, N That Uses - 1999
1 I/O-Optimal Planar Embedding Using Graph Separators – Norbert Zeh - 2001
1 External Data Structures for Shortest Path Queries on Planar Digraphs – Lars Arge, Laura Toma
5 Blocking in Parallel Multisearch Problems (Extended Abstract) – Wolfgang Dittrich, David Hutchinson, Anil Maheshwari - 1998
4 Parallel Algorithms in External Memory – David Alexander Hutchinson - 2000
10 Reducing i/o complexity by simulating coarse grained parallel algorithms – Frank Dehne, David Hutchinson, Anil Maheshwari, Wolfgang Dittrich - 1999
5 An external-memory data structure for shortest path queries – Von Norbert Zeh, Fakult"at Mathematik Informatik, Norbert Zeh, Diplomarbeit Norbert Zeh - 1998
2 Translating submachine locality into locality of reference – Carlo Fantozzi, Andrea Pietracaprina - 2006
ParallelExternalMemoryGraphAlgorithms – Lars Arge, Michael T. Goodrich, Nodari Sitchinava
10 Parallel External Memory Graph Algorithms – Lars Arge, Michael T. Goodrich, Nodari Sitchinava
13 I/O-Efficient Algorithms for Shortest Path Related Problems – Norbert Ralf Zeh - 2002
27 Randomized External-Memory Algorithms for Some Geometric Problems – A. Crauser, P. Ferragina, K. Mehlhorn, U. Meyer, E. Ramos - 2001
9 Bulk Synchronous Parallel Algorithms for the External Memory Model – Frank Dehne, Wolfgang Dittrich, David Hutchinson, Anil Maheshwari - 2002
15 I/O-efficient algorithms for graphs of bounded treewidth – Anil Maheshwari, Norbert Zeh - 2001
Submatrix maximum . . . Monge partial matrices, and their applications – Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir - 2012
Submatrix . . . partial Monge matrices, and their applications – Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir
4 Oracles for bounded length shortest paths in planar graphs – Maciej Kurowski
www.elsevier.com/locate/disc Localized and compact data-structure for comparability graphs – Fabrice Bazzaro, Cyril Gavoille - 2007