Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study-Reference-Cited by-同舟云学术

Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study

Published:2001 Issue: Volume: Page:218-229
ISSN:0302-9743
Container-title:Algorithm Engineering
language:
Short-container-title:

Author:

Demetrescu Camil,Frigioni Daniele,Marchetti-Spaccamela Alberto,Nanni Umberto

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44691-5_19

Reference16 articles.

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993.

2. D. Alberts, G. Cattaneo, and G. F. Italiano. An empirical study of dynamic graph algorithms. ACM Journal on Experimental Algorithmics, 2:Article 5, 1997.

3. G. Amato, G. Cattaneo, and G. F. Italiano. Experimental analysis of dynamic minimum spanning tree algorithms. In ACM-SIAM Symp. on Discrete Algorithms, pp. 1–10, 1997.

4. B. V. Cherkassky and A. V. Goldberg. Negative-cycle detection algorithms. In European Symp. on Algorithms. Lect. Notes in Comp. Sc. 1136, pp. 349–363, 1996.

5. B. V. Cherkassky, A. V. Goldberg, and T. Radzik. Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming, 73:129–174, 1996.

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

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

2. An integrated approach for earthwork allocation, sequencing and routing;European Journal of Operational Research;2014-11

3. Maintaining Shortest Path Tree in Dynamic Digraphs Having Negative Edge-Weights;Advances in Parallel Distributed Computing;2011

4. Shortest Path Routing Algorithms in Multihop Networks;Encyclopedia of Information Science and Technology, Second Edition;2009

5. Speeding Up Dynamic Shortest-Path Algorithms;INFORMS Journal on Computing;2008-05