Reachability and distance queries via 2-hop labels

714 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A Survey of Autonomous Driving: Common Practices and Emerging Technologies (2019, background): “One possible solution to this is to use hub labeling (HL) [248].”
Self-Driving Cars: A Survey (2019, methodology): “A bounded-hop algorithm is HL (Hub Labeling) [COH03], which, during the preprocessing phase, computes a label L(u) for each vertex u of the graph, which consists of a set of hub”
Fast exact shortest-path distance queries on large networks by pruned landmark labeling (2013, methodology): “The general framework of 2-hop cover [13,12,2], or sometimes called a labeling method, is as follows.”
Graphs-at-a-time: query language and access methods for graph databases (2008, background): “Indexing and processing of reachability queries are generally based on spanning trees with pre/post-order labeling [6, 32, 33] or 2-hop-cover [8, 9, 27].”
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks (2011, background): “Labeling algorithms have been studied before in more theoretical settings [6,12,21].”
Route Planning in Transportation Networks (2015, background): “Approximation algorithms to compute small labels have also been studied [16,64,80]; although they can find slightly better labels than faster heuristics [5,77], their running time is prohibitive [80].”