Skip to Content

2 Results Found

  • Article
  • Open Access
21 Citations
6,797 Views
20 Pages

Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies

  • Lars Gottesbüren,
  • Michael Hamann,
  • Tim Niklas Uhl and
  • Dorothea Wagner

16 September 2019

Graph partitioning has many applications. We consider the acceleration of shortest path queries in road networks using Customizable Contraction Hierarchies (CCH). It is based on computing a nested dissection order by recursively dividing the road net...

  • Article
  • Open Access
19 Citations
6,887 Views
31 Pages

16 March 2021

We study the problem of quickly computing point-to-point shortest paths in massive road networks with traffic predictions. Incorporating traffic predictions into routing allows, for example, to avoid commuter traffic congestions. Existing techniques...

(This article belongs to the Special Issue Algorithms for Shortest Paths in Dynamic and Evolving Networks)