Implementation of Dynamic Trees with In-Subtree Operations

ACM Journal of Experimental Algorithmics

Volumn 3, Issue , 1998, Pages 9-

  Radzik, Tomasz ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Algorithms; Design; dynamic minimum spanning tree; Dynamic trees; Experimentation; Performance; splay trees

Indexed keywords

EID: 84956856498     PISSN: 10846654     EISSN: 10846654     Source Type: Journal    
DOI: 10.1145/297096.297144     Document Type: Article

References (16)

1. Ahuja, R. K., Oelin, J. B., and Taejan, R. E., 1989, Maximum Flow Problem. SJAM J. Comput. 18, 939-954.
2. Amato, G., Cattaneo, G., and Italiano, G. F. 1997. Experimental analysis of dynamic minimum spanning tree algorithms. In Proc. 8th Annual ACM-SJAM Symposium on Discrete Algorithms (1997).
3. Bent, S. W., Sleatoe, D. D., and Taejan, R. E. 1985. Biased Search Trees. SIAM J. Comput. 14, 3, 545-568.
4. Ceeny, V. 1985. A thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. J. Optimization Theory and Appl. 45, 41-51.
5. Eppstein, D., Galil, Z., Italiano, G. F., and Nissenzweig, A. 1992. Sparsification - a technique for speeding up dynamic graph algorithms. In Proc. 33rd IEEE Annual Symposium on Foundations of Computer Science (1992), pp. 60-69.
6. Feedeeickson, G. N. 1985. Data structures for on-line updating of minimum spanning trees, with applications. SIAM J. Comput. 14, 4, 781-798.
7. Feedman, M. L., Johnson, D. S., McGeoch, L. A., and Ostheimee, G. 1995. Data structures for traveling salesmen. J. Alg. 18, 3, 432-479.
8. Goldbeeg, A. V., Tardos, E., and Taejan, R. E. 1990. Network Flow Algorithms. In B. Korte, L. Lovás, H. Prömel, and A. Schrijvee Eds., Paths, Flows, and VLSI-layout, pp. 101-164. Springer-Verlag.
9. Goldbeeg, A. V. and Tarjan, R. E. 1989. Finding minimum-cost circulations by canceling negative cycles. J. Assoc. Comput. Mach. 36, 388-397.
10. Goldberg, A. V. and Tarjan, R. E. 1990. Finding Minimum-Cost Circulations by Successive Approximation. Math. Oper. Res. 15, 430-466.
11. Henzinger, M. R. and King, V. 1997. Maintaining minimum spanning trees in dynamic graphs. In Proc. 24th International Colloquium on Automata, Languages and Programming (July 1997).
12. Kirkpatric, S., C. D. Gelatt, J., and Vecchi, M. P. 1983. Optimization by simulated annealing. Science 220, 671-680.
13. Mehlhorn, K. and Näher, S. 1995. LEDA, A platform for combinatorial and geometric computing. Comm. ACM 38, 1, 96-102.
14. Sleator, D. D. and Taejan, R. E. 1983. A Data Structure for Dynamic Trees. J. Comput. System Sci. 26, 362-391.
15. Sleator, D. D. and Tarjan, R. E. 1985. Self-adjusting binary search trees. J. Assoc. Comput. Mach. 32, 652-686.
16. Tarjan, R. E. 1983. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA.