Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies
share
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 acceptable quality. We combine the techniques of both algorithms to achieve more than six times faster preprocessing times than FlowCutter and even slightly better quality. We show that using 16 cores of a shared-memory machine, this preprocessing needs four minutes on the Europe road network.
READ FULL TEXT