Data sets in large applications are often too massive to fit completely inside the computers
internal memory. The resulting input/output communication (or I/O) between fast internal …

Data sets in large applications are often too massive to fit completely inside the computer's
internal memory. The resulting input/output communication (or I/O) between fast internal …

We study the ALT algorithm [19] for the point-to-point shortest path problem in the context of
road networks. We suggest improvements to the algorithm itself and to its preprocessing …

We study the problem of computing shortest path or distance between two query vertices in
a graph, which has numerous important applications. Quite a number of indexes have been …

We propose a novel disk-based index for processing single-source shortest path or distance
queries. The index is useful in a wide range of important applications (eg, network analysis …

This paper investigates two types of graph queries: single source distance (SSD) queries
and single source shortest path (SSSP) queries. Given a node v in a graph G, an SSD query …

We present improved cache-oblivious data structures and algorithms for breadth-first search
and the single-source shortest path problem on undirected graphs with non-negative edge …

We study the impact of using different priority queues in the performance of Dijkstra's SSSP
algorithm. We consider only general priority queues that can handle any type of keys …

A strongly connected component (SCC) is a maximal subgraph of a directed graph G in
which every pair of nodes are reachable from each other in the SCC. With such a property, a …

We report on initial experimental results for a practical I/O-efficient Single-Source Shortest-
Paths (SSSP) algorithm on general undirected sparse graphs where the ratio between the …