Next Article in Journal
Compression Challenges in Large Scale Partial Differential Equation Solvers
Next Article in Special Issue
Correspondence between Multilevel Graph Partitions and Tree Decompositions
Previous Article in Journal
An Intelligent Artificial Neural Network Modeling of a Magnetorheological Elastomer Isolator
Previous Article in Special Issue
Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics
Open AccessArticle

Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies

Institute of Theoretical Informatics, Karlsruhe Institute of Technology, Am Fasanengarten 5, 76131 Karlsruhe, Germany
*
Author to whom correspondence should be addressed.
Algorithms 2019, 12(9), 196; https://doi.org/10.3390/a12090196
Received: 29 June 2019 / Revised: 26 August 2019 / Accepted: 4 September 2019 / Published: 16 September 2019
(This article belongs to the Special Issue Graph Partitioning: Theory, Engineering, and Applications)
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. View Full-Text
Keywords: graph partitioning; nested dissection; route planning; customizable contraction hierarchies graph partitioning; nested dissection; route planning; customizable contraction hierarchies
Show Figures

Figure 1

MDPI and ACS Style

Gottesbüren, L.; Hamann, M.; Uhl, T.N.; Wagner, D. Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies. Algorithms 2019, 12, 196.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop