Maintaining dynamic minimum spanning trees: An experimental study

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2409, Issue , 2002, Pages 111-125

  Cattaneo, Giuseppe ^a   Faruolo, Pompeo ^a   Ferraro Petrillo, Umberto ^a   Italiano, Giuseppe F ^b  

^a UNIVERSITY OF SALERNO   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS; ARTIFICIAL INTELLIGENCE;

DYNAMIC ALGORITHM; DYNAMIC GRAPH; EMPIRICAL STUDIES; MINIMUM SPANNING TREES; POLYLOGARITHMIC; S-ALGORITHMS; SPARSIFICATION; WORST CASE INPUTS;

ARTIFICIAL INTELLIGENCE; ALGORITHMS;

EID: 84929073279     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45643-0_9     Document Type: Conference Paper

References (29)

1. D. Alberts, G. Cattaneo, G. F. Italiano, “An empirical study of dynamic graph algorithms”, ACM Journal on Experimental Algorithmics, vol. 2 (1997).
2. D. Alberts, G. Cattaneo, G. F. Italiano, U. Nanni, C. D. Zaroliagis “A Software Library of Dynamic Graph Algorithms”. Proc. Algorithms and Experiments (ALEX 98), Trento, Italy, February 9–11, 1998, R. Battiti and A. A. Bertossi (Eds), pp. 129–136.
3. D. Alberts, M. R. Henzinger, “Average Case Analysis of Dynamic Graph Algorithms”, Proc. 6th Symp. on Discrete Algorithms (1995), 312–321.
4. C.R. Aragon, R. Seidel, “Randomized search trees”, Proc. 30th Annual Symp. on Foundations ofComputer Science (FOCS 89), 1989, pp. 540–545.
5. G. Amato, G. Cattaneo, G. F. Italiano, “Experimental Analysis of Dynamic Minimum SpanningTree Algorithms”, Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms, (1997), 5–7.
6. B. Bollobás. Random Graphs. Academic Press, London, 1985.
7. T. H. Cormen, C. E. Leiserson, R. L. Rivest. Introduction to Algorithms. Mac-Graw Hill, NY, 1990.
8. C. Demetrescu, D. Frigioni, A. Marchetti-Spaccamela, U. Nanni. “Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study.” Procs. 3rd Workshop on Algorithm Engineering (WAE2000). Lecture Notes in Computer Science, Springer-Verlag, 2001.
9. C. Demetrescu and G.F. Italiano. Fully dynamic transitive closure: Breaking through the O(n2) barrier. Proc. ofthe 41st IEEE Annual Symposium on Foundations ofComputer Science (FOCS’00), pages 381-389, 2000.
10. C. Demetrescu, G. F. Italiano, “Fully Dynamic All Pairs Shortest Paths with Real Edge Weights”. Proc. 42nd IEEE Annual Symp. on Foundations ofComputer Science (FOCS 2001), Las Vegas, NV, U.S.A., October 14-17, 2001.
11. D. Eppstein, Z. Galil, G. F. Italiano and A. Nissenzweig, “Sparsification – A technique for speeding up dynamic graph algorithms”. In Journal ofACM, Vol. 44, 1997, pp. 669-696.
12. D. Eppstein, Z. Galil, G. F. Italiano, T. H. Spencer, “Separator based sparsification for dynamic planar graph algorithms”, Proc. 25th ACM Symposium on Theory of Computing (1993), 208–217.
13. D. Eppstein, G. F. Italiano, R. Tamassia, R. E. Tarjan, J. Westbrook, and M. Yung, Maintenance of a minimum spanningforest in a dynamic plane graph, J. Algorithms, 13:33–54, 1992.
14. G.N. Frederickson, “Data structures for on-line updatingof minimum spanning trees, with applications”, SIAM J. Comput. 14 (1985), 781–798.
15. G.N. Frederickson, “Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanningtrees”, Proc. 32nd IEEE Symp. Foundations ofComputer Science (1991), 632–641.
16. D. Frigioni, M. Ioffreda, U. Nanni, G. Pasqualone. “Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem.” ACM Journal on Experimental Algorithmics, vol. 3 (1998), Article 5.
17. D. Frigioni, T. Miller, U. Nanni, G. Pasqualone, G. Schaefer, and C. Zaroliagis “An experimental study of dynamic algorithms for directed graphs”, in Proc. 6th European Symp. on Algorithms, Lecture Notes in Computer Science 1461 (Springer-Verlag, 1998), pp.368-380.
18. M. R. Henzinger and V. King, Randomized dynamic graph algorithms with poly-logarithmic time per operation,Proc. 27th Symp. on Theory ofComputing, 1995, 519–527.
19. M. R. Henzinger and V. King, Fully dynamic biconnectivity and transitive closure, Proc. 36th IEEE Symp. Foundations ofComputer Science, pages 664–672, 1995.
20. M. R. Henzinger and V. King, Maintainig minimum spanning trees in dynamic graphs, Proc. 24th Int. Coll. Automata, Languages and Programming (ICALP 97), pages 594–604, 1997.
21. J. Holm, K. de Lichtenberg, and M. Thorup, Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and bicon-nectivity. Proc. 30th Symp. on Theory ofComputing (1998), pp. 79-89.
22. R. Iyer, D. R. Karger, H. S. Rahul, and M. Thorup, An Experimental Study of Poly-Logarithmic Fully-Dynamic Connectivity Algorithms, Proc. Workshop on Algorithm Engineering and Experimentation, 2000.
23. V. King. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. Proc. 40th IEEE Symposium on Foundations of Computer Science (FOCS’99), 1999.
24. V. King and G. Sagert. A fully dynamic algorithm for maintaining the transitive closure. Proc. 31st ACM Symposium on Theory ofComputing (STOC’99), pages 492-498, 1999.
25. J. B. Kruskal, On the shortest spanningsubtree of a graph and the traveling salesman problem, Proc. Amer. Math. Soc. 7, (1956), 48–50.
26. K. Melhorn and S. Näher, “LEDA, A platform for combinatorial and geometric computing”. Comm. ACM, (1995), 38(1): pp.96-102.
27. M. Rauch, “Improved data structures for fully dynamic biconnectivity”, Proc. 26th Symp. on Theory ofComputing (1994), 686–695.
28. D. D. Sleator and R. E. Tarjan, A data structure for dynamic trees, J. Comp. Syst. Sci., 24:362–381, 1983.
29. R. E. Tarjan and J. van Leeuwen, Worst-case analysis of set union algorithms, J. Assoc. Comput. Mach., 31:245–281, 1984.