A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully-dynamic batch algorithms for single-source shortest paths in directed graphs with positive edge weights. We give an extensive experimental study of the existing algorithms for the single-edge and the batch case, including a broad set of test instances. We further present tuned variants of the already existing SWSF-FP-algorithm being up to 15 times faster than SWSF-FP. A surprising outcome of the paper is the astonishing level of data dependency of the algorithms. More detailed descriptions and further experimental results of this work can be found in [1]. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Bauer, R., & Wagner, D. (2009). Batch dynamic single-source shortest-path algorithms: An experimental study. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5526 LNCS, pp. 51–62). https://doi.org/10.1007/978-3-642-02011-7_7
Mendeley helps you to discover research relevant for your work.