Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,807,743 papers from all fields of science
Search
Sign In
Create Free Account
Contraction hierarchies
Known as:
Highway hierarchy
, Contraction hierarchy
, Contraction
Expand
In applied mathematics, the method of contraction hierarchies is a technique to speed up shortest-path routing by first creating precomputed…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Algorithm
Dijkstra's algorithm
Graph (abstract data type)
Graph (discrete mathematics)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
High-Throughput Network Distance Computations for Spatial Analytics Inside Any Store
Shangfu Peng
2018
Corpus ID: 199578488
Title of dissertation: High-Throughput Network Distance Computations for Spatial Analytics Inside Any Store Shangfu Peng Doctor…
Expand
2014
2014
2 Prior Work 2 . 1 Contraction Hierarchies : Faster and Simpler Hierarchical Routing in Road Networks
A. Mahendra
,
P. Butler
,
Yang Xu
2014
Corpus ID: 14813698
One commonplace application of shortest-path graph search is navigational routing. Given that the road network is relatively…
Expand
2009
2009
Highway hierarchies dualized : a mathematical analysis of a shortest-path algorithm (Top Thesis)
Noortje Groot
2009
Corpus ID: 58220136
2008
2008
Goal Directed Speed-Up Techniques for Shortest Path Queries in Timetable Networks
Inf. Daniel Delling
2008
Corpus ID: 39403523
Almost any transport company, like railway companies or air lines, have timetables for planning and scheduling their specific…
Expand
2006
2006
Efficient Computation of Many-to-Many Shortest Paths
Sebastian Knopp
,
F. Schulz
2006
Corpus ID: 41016897
Considering large road networks, we are interested in finding all quickest connections between given source and target locations…
Expand
2006
2006
I/O Efficieny of Highway Hierarchies
R. Jacob
,
Sushant Sachdeva
2006
Corpus ID: 56089364
Recently, Sanders and Schultes presented a shortest path algorithm, named Highway Hierarchies, for fast point-to-point shortest…
Expand
2006
2006
Fast Computation of Distance Tables using Highway Hierarchies
Sebastian Knopp
,
P. Sanders
,
Dominik Schultes
,
F. Schulz
,
D. Wagner
2006
Corpus ID: 14431413
This technical report considers the problem of computing distances of shortest paths between all pairs of nodes from given sets…
Expand
2006
2006
I/O efficiency of highway hierarchies
R. Jacob
,
Sushant Sachdeva
2006
Corpus ID: 60509941
Recently, Sanders and Schultes presented a shortest path algorithm, named Highway Hierarchies, for fast point-to-point shortest…
Expand
2006
2006
Engineering and applications track - engineering highway hierarchies
P. Sanders
,
Dominik Schultes
2006
Corpus ID: 201126120
2005
2005
Fast and Exact Shortest Path Queries Using Highway Hierarchies
Dominik Schultes
,
M. Holzer
,
D. Matijević
,
F. Schulz
2005
Corpus ID: 7037982
The computation of shortest paths in a graph is a well-known problem in graph theory. One of the most obvious practical…
Expand