We consider the point-to-point (approximate) shortest-path query problem, which is the
following generalization of the classical single-source (SSSP) and all-pairs shortest-path …

In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

We survey recent advances in algorithms for route planning in transportation networks. For
road networks, we show that one can compute driving directions in milliseconds or less even …

We present a route planning technique solely based on the concept of node contraction. The
nodes are first ordered by 'importance'. A hierarchy is then generated by iteratively …

Contraction hierarchies are a simple approach for fast routing in road networks. Our
algorithm calculates exact shortest paths and handles road networks of whole continents …

Algorithms for route planning in transportation networks have recently undergone a rapid
development, leading to methods that are up to three million times faster than Dijkstra's …

A shortest-path algorithm finds a path containing the minimal cost between two vertices in a
graph. A plethora of shortest-path algorithms is studied in the literature that span across …

Abstract Abraham et al.[SODA 2010] have recently presented a theoretical analysis of
several practical point-to-point shortest path algorithms based on modeling road networks …

The Shapley value---probably the most important normative payoff division scheme in
coalitional games---has recently been advocated as a useful measure of centrality in …

Estimating the importance or centrality of the nodes in large networks has recently attracted
increased interest. Betweenness is one of the most important centrality indices, which …