Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14340
For citation please use:
Main Title: Partitioning Graphs to Speed Up Dijkstra's Algorithm
Author(s): Möhring, Rolf H.
Schilling, Heiko
Schütz, Birk
Wagner, Dorothea
Willhalm, Thomas
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15567
http://dx.doi.org/10.14279/depositonce-14340
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: In this paper, we consider Dijkstra's algorithm for the point-to-point shortest path problem in large and sparse graphs with a given layout. Lauther presented a method that uses a partitioning of the graph to perform a preprocessing which allows to speed-up Dijkstra's algorithm considerably. We present an experimental study that evaluates which partitioning methods are suited for this approach. In particular, we examine partitioning algorithms from computational geometry and compare their impact on the speed-up of the shortest-path algorithm. Using a suited partitioning algorithm speed-up factors of 500 and more were achieved. Furthermore, we present an extension of this speed-up technique to multiple levels of partitionings. With this multi-level variant, the same speed-up factors can be achieved with smaller space requirements. It can therefore be seen as a compression of the precomputed data that conserves the correctness of the computed shortest paths.
Subject(s): graph algorithms
directed graphs, tournaments
traffic problems
programming involving graphs or networks
approximation methods and heuristics
Issue Date: 2005
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
MSC 2000: 05C85 Graph algorithms
05C20 Directed graphs, tournaments
90B20 Traffic problems
90C35 Programming involving graphs or networks
90C59 Approximation methods and heuristics
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2005, 11
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-011-2005.pdf
Format: Adobe PDF | Size: 1.08 MB
DownloadShow Preview
Thumbnail
Report-011-2005.ps
Format: Postscript | Size: 5.15 MB
Download
Report-011-2005.ps.gz
Format: Unknown | Size: 1.18 MB
Download

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.