An external memory data structure for shortest path queries ?
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and sort(N) denote the number of input/output (I/O) operations required to sort an array of length N:
shortest paths planar graphs external-memory algorithms graph algorithms