A Data Structure for Dynamically Maintaining Rooted Trees

Journal of Algorithms

Volumn 24, Issue 1, 1997, Pages 37-65

  Frederickson, Greg N ^a  

^a Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347211617     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0835     Document Type: Article

References (23)

1. K. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka, A simple parallel tree contraction algorithm, J. Algorithms 10 (1989), 287-302.
2. S. Arnborg, J. Lagergren, and D. Seese, Easy problems for tree-decomposable graphs, J. Algorithms 12 (1991), 308-340.
3. S. W. Bent, D. D. Sleator, and R. E. Tarjan, Biased search trees, SIAM J. Comput. 14 (1985), 545-568.
4. M. W. Bern, E. L. Lawler, and A. L. Wong, Linear-time computation of optimal subgraphs of decomposable graphs, J. Algorithms 8 (1987), 216-235.
5. R. G. Bland, J. Cheriyan, D. L. Jensen, and L. Ladanyi, personal communication, 1992.
6. R. B. Borie, R. G. Parker, and C. A. Tovey, Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families, Algorithmica 7 (1992), 555-582.
7. R. P. Brent, The parallel evaluation of arithmetic expressions in logarithmic time, in "Complexity of Sequential and Parallel Numerical Algorithms," pp. 83-102, Academic Press, New York, 1973.
8. R. F. Cohen and R. Tamassia, Dynamic Expression Trees, Algorithmica 13 (1995) 245-265.
9. R. Cole and U. Vishkin, The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time, Algorithmica 3 (1988), 329-346.
10. D. Eppstein, G. F. Italiano, R. Tamassia, R. E. Tarjan, J. Westbrook, and M. Yung, Maintenance of a minimum spanning forest in a dynamic plane graph, J. Algorithms 13 (1992), 33-54.
11. G. N. Frederickson, Maintaining regular properties dynamically in k-terminal graphs, Algorithmica, to appear.
12. G. N. Frederickson, Data structures for on-line updating of minimum spanning trees, with applications, SIAM J. Comput. 14 (1985), 781-798.
13. G. N. Frederickson, Ambivalent data structures for dynamic 2-edge connectivity and k smallest spanning trees, in "Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science," pp. 632-641, 1991.
14. G. N. Frederickson, A data structure for dynamically maintaining rooted trees, in "Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms," pp. 175-184, 1993.
15. G. N. Frederickson, Ambivalent data structures for dynamic 2-edge connectivity and k smallest spanning trees, SIAM J. Computing, to appear.
16. A. V. Goldberg, M. D. Grigoriadis, and R. E. Tarjan, Use of dynamic trees in a network simplex algorithm for the maximum flow problem, Math. Prog. 50 (1991), 277-290.
17. A. V. Goldberg and R. E. Tarjan, A new approach to the maximum-flow problem, J. Assoc. Comput. Mech. 35 (1988), 921-940.
18. M. T. Goodrich, Planar separators and parallel polygon triangulation, J. Comput. System Sci. 51 (1995) 374-389.
19. F. Harary, "Graph Theory," Addison-Wesley, Reading, MA, 1969.
20. D. Klingman, A. Napier, and J. Stutz, NETGEN: A program for generating large scale capacitated assignment, transportation, and minimum cost flow problems, Management Sci. 20 (1974), 814-821.
21. G. L. Miller and J. H. Reif, Parallel tree contraction and its application, J. Comput. System Sci., to appear.
22. D. D. Sleator and R. E. Tarjan, A data structure for dynamic trees, J. Comput. System Sci. 26 (1983), 362-391.
23. D. D. Sleator and R. E. Tarjan, Self-adjusting binary search trees, J. Assoc. Comput. Mech. 32 (1985), 652-686.