Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies
Abstract
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 network into parts. Recently, with FlowCutter and Inertial Flow, two flow-based graph bipartitioning algorithms have been proposed for road networks. While FlowCutter achieves high-quality results and thus fast query times, it is rather slow. Inertial Flow is particularly fast due to the use of geographical information while still achieving decent query times. We combine the techniques of both algorithms to achieve more than six times faster preprocessing times than FlowCutter and even faster queries on the Europe road network. We show that using 16 cores of a shared-memory machine, this preprocessing needs four minutes.
Keywords
Cite
@article{arxiv.1906.11811,
title = {Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies},
author = {Lars Gottesbüren and Michael Hamann and Tim Niklas Uhl and Dorothea Wagner},
journal= {arXiv preprint arXiv:1906.11811},
year = {2020}
}
Comments
18 pages, 8 tables; v2: re-run experiments of competing algorithms