Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Paths Problem

ACM Journal of Experimental Algorithmics

Volumn 3, Issue , 1998, Pages 5-

  Frigioni, Daniele ^a   loffreda, Mario ^a   Nanni, Umberto ^a   Pasqualone, Giulio ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84995294174     PISSN: 10846654     EISSN: 10846654     Source Type: Journal    
DOI: 10.1145/297096.297147     Document Type: Article

References (34)

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 J. Experimental Algorithmcs 2, 5 (1997), www. jea. a cm. org/ 1997/Albert sDynamic/.
3. B. Alpern, R. Hoover, B.K. Rosen, P.F. Sweeney, and F.K. Zadeck, “Incremental evaluation of computational circuits.” Proc. ACM-SIAM Symp. Discrete Algs., 32-42, 1990.
4. G. Amato, G. Cattaneo, and G. F. Italiano, “Experimental analysis of dynamic minimum spanning tree algorithms,” Proc. ACM-SIAM Symp. Discrete Algs., 1-10, 1997.
5. G. Ausiello, G. F. Italiano, A. Marchetti-Spaccamela, and U. Nanni, “Incremental algorithms for minimal length paths,” J. Algs. 12, 4 (1991), 615-638. [6]
6. M. Barbehenn and S. Hutchinson, “Efficient search and hierarchical motion planning by dynamically maintaining single-source shortest-paths trees,” IEEE Trans. Robotics and Automation 11, 2 (1995), 198-214.
7. T. Bates, E. Gerich, L. Joncheray, J.-M. Jouanigot, D. Karrenberg, M. Terpstra, and J. Yu, “Representation of IP routing policies in a routing registry” Technical report RIPE-181, October 1994.
8. S. Chaudhuri and C. D. Zaroliagis, “Shortest path queries in digraph of small treewidth,” Proc. Int’l Colloq. Automata, Languages, and Programming, in Lecture Notes in Comput. Sci. 944, 244-255, 1995.
9. B. V. Cherkassky and A. V. Goldberg, “Negative-cycle detection algorithms,” Proc. European Symp. Algs., in Lecture Notes in Comput. Sci. 1136, 349-363, 1996.
10. B. V. Cherkassky, A. V. Goldberg, and T. Radzik, “Shortest paths algorithms: theory and experimental evaluation,” Proc. ACM-SIAM Symp. Discrete Algorithms, 516-525, 1994.
11. E. W. Dijkstra, “A note on two problems in connection with graphs,” Numerische Mathematik 1 (1959), 269-271.
12. D. Eppstein, Z. Galil, G. F. Italiano, and A. Nissenzweig, “Sparsification-a technique for speeding up dynamic graph algorithms,” J. ACM 44 (1997), 669-696.
13. S. Even and H. Gazit, “Updating distances in dynamic graphs,” Methods of Operations Research 49 (1985), 371-387.
14. E. Feuerstein and A. Marchetti-Spaccamela, “On-line algorithms for shortest paths in planar graphs,” Theor. Comput. Sci. 116 (1993), 359-371.
15. P. G. Franciosa, D. Frigioni, and R. Giaccio, “Semi-dynamic shortest paths and breadth-first search on digraphs,” Proc. Symp. Theor. Aspects Comput. Sci. in Lecture Notes in Comput. Sci. 1200, 33-46, 1997.
16. M. L. Fredman and R. E. Tarjan, “Fibonacci heaps and their use in improved network optimization algorithms,” J. ACM 34 (1987), 596-615.
17. D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni, “Semi-dynamic algorithms for maintaining single-source shortest-paths trees,” Algorithmica 22, 3 (1998), 250-274.
18. D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni, “Fully dynamic output-bounded single-source shortest-paths problem,” Proc. ACM-SIAM Symp. Discrete Algorithms, 212-221, 1996.
19. D. Frigioni, T. Miller, U. Nanni, G. Pasqualone, G. Shaefer, and C. Zaroliagis, “An experimental study of dynamic algorithms for directed graphs,” Proc. European Symp. Algs. in Lecture Notes in Comput. Sci. 1461, 368-380, 1998.
20. A.V. Goldberg and C. Silverstein, “Implementations of Dijkstra's algorithm based on multilevel buckets,” Technical Report 95-187, NEC Research Institute, Inc., November 1995.
21. A.V. Goldberg and R. E. Tarjan, “Expected performances of Dijkstra's shortest-paths algorithm,” Technical Report 96-062, NEC Research Institute, Inc., June 1996.
22. M. R. Henzinger and V. King, Randomized dynamic graph algorithms with polylogarithmic time per operation,” Proc. ACM Symp. Theory Comput. 519-527, 1995.
23. M. R. Henzinger, P. N. Klein, S. Rao, and S. Subramanian, “Faster shortest-path algorithms for planar graphs,” J. Comput. System Sci. 55, 1 (1997), 3-23.
24. G. F. Italiano, “Amortized efficiency of a path retrieval data structure.” Theor. Comput. Sci. 48 (1986), 273-281.
25. G. F. Italiano, “Finding paths and deleting edges in directed acyclic graphs,” Inf. Proc. Letters 28 (1988), 5-11.
26. S. M. Malitz, “Genus g graphs have pagenumber [formula omitted],” J. Algs. 17 (1994), 85-109.
27. K. Mehlhorn and S. Näher, “leda, a platform for combinatorial and geometric computing,” Commun. ACM 38 (1995), 96-102.
28. K. Mehlhorn, S. Näher, and C. Uhrig. The leda User Manual, Version 3.5. Technical report, Max Planck Institut für Informatik, 1997.
29. G. Ramalingam. Bounded Incremental Computation. Lecture Notes in Computer Science 1089, 1996.
30. G. Ramalingam and T. Reps, “On the computational complexity of dynamic graph problems,” Theor. Comput. Sci. 158 (1996), 233-277.
31. G. Ramalingam and T. Reps, “An incremental algorithm for a generalization of the shortest-paths problem,” J. Algs. 21 (1996), 267-305.
32. R. Raman, “Recent results on single-source shortest-paths problems,” SIGACT News 28 (1997), 81-87.
33. H. Rohnert, “A dynamization of the all-pairs least-cost paths problem,” Proc. Symp. Theor. Aspects of Comput. Sei. in Lecture Notes in Comput. Sci. 182, 279-286, 1985.
34. M. Thorup, “Undirected single-source shortest paths in linear time,” Proc. IEEE Symp. Foundations Comput. Sci. 12-21, 1997.