Experimental analysis of dynamic all pairs shortest path algorithms-Reference-Cited by-同舟云学术

Experimental analysis of dynamic all pairs shortest path algorithms

Published:2006-10 Issue:4 Volume:2 Page:578-601
ISSN:1549-6325
Container-title:ACM Transactions on Algorithms
language:en
Short-container-title:ACM Trans. Algorithms

Author:

Demetrescu Camil¹,Italiano Giuseppe F.²

Affiliation:

1. Università di Roma “La Sapienza”, Rome, Italy

2. Università di Roma “Tor Vergata”, Rome, Italy

Abstract

We present the results of an extensive computational study on dynamic algorithms for all pairs shortest path problems. We describe our implementations of the recent dynamic algorithms of King [1999] and of Demetrescu and Italiano [2006], and compare them to the dynamic algorithm of Ramalingam and Reps and to static algorithms on random, real-world and hard instances. Our experimental data suggest that some of the dynamic algorithms and their algorithmic techniques can be really of practical value in many situations.

Publisher

Association for Computing Machinery (ACM)

Subject

Mathematics (miscellaneous)

Link

https://dl.acm.org/doi/pdf/10.1145/1198513.1198519

Reference30 articles.

1. An empirical study of dynamic graph algorithms

Cited by 47 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. GPU-Accelerated BFS for Dynamic Networks;Lecture Notes in Computer Science;2024

2. A Parallel Algorithm for Updating a Multi-objective Shortest Path in Large Dynamic Networks;Proceedings of the SC '23 Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis;2023-11-12

3. Multi-Objective Decision-Making Meets Dynamic Shortest Path: Challenges and Prospects;Algorithms;2023-03-16

4. The Floyd‐Warshall all‐pairs shortest paths algorithm for disconnected and very sparse graphs;Software: Practice and Experience;2023-02

5. Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide;ACM Journal of Experimental Algorithmics;2022-12-13