Contraction hierarchies

Known as: Highway hierarchy, Contraction hierarchy, Contraction 
In applied mathematics, the method of contraction hierarchies is a technique to speed up shortest-path routing by first creating precomputed… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
We consider the problem of quickly computing shortest paths in weighted graphs. Often, this is achieved in two phases: 1) derive… (More)
  • figure 1
  • figure 3
  • figure 6
  • figure 7
  • table 1
Is this relevant?
2013
2013
Many speed-up techniques developed for accelerating the computation of shortest paths in road networks, like reach or contraction… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2013
2013
Time-dependent road networks are represented as weighted graphs, where the weight of an edge depends on the time one passes… (More)
  • table I
  • table II
  • table III
  • figure 1
  • table IV
Is this relevant?
Highly Cited
2012
Highly Cited
2012
C hierarchies are a simple approach for fast routing in road networks. Our algorithm calculates exact shortest paths and handles… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
For some graph classes, most notably real-world road networks, shortest path queries can be answered very efficiently if the… (More)
  • figure 1
Is this relevant?
2010
2010
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2010
2010
Time-dependent Contraction Hierarchies provide fast and exact route planning for time-dependent large scale road networks but… (More)
  • table 1
  • table 2
  • figure 1
  • table 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2009
2009
Time-Dependent Contraction Hierarchies is a routing technique that solves the shortest path problem in graphs with time-dependent… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We present a route planning technique solely based on the concept of node contraction. We contract or remove one node at a time… (More)
Is this relevant?