Self-adjusting top trees

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 813-822

  Tarjan, Robert E ^a   Werneck, Renato F ^b  

^a PRINCETON UNIVERSITY   (United States)

^b Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; ST-TREES; TERNARIZATION; TOPOLOGY TREES;

ALGORITHMS; DATA STRUCTURES; GRAPH THEORY; HIERARCHICAL SYSTEMS; PROBLEM SOLVING; THEOREM PROVING; TOPOLOGY;

TREES (MATHEMATICS);

EID: 20744459018     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. U. A. Acar, G. E. Blelloch, R. Harper, J. L. Vittes, and S. L. M. Woo. Dynamizing static algorithms, with applications to dynamic trees and history independence. In Proceedings of the Fifteenth ACM-SIAM Symposium on Discrete Algorithms, pages 524-533, 2004.
2. R. K. Ahuja, J. B. Orlin, and R. E. Tarjan. Improved time bounds for the maximum flow problem. SIAM Journal on Computing, 18(5):939-954, 1989.
3. S. Alstrup, J. Holm, K. de Lichtenberg, and M. Thorup. Maintaining diameter, center, and median of fully-dynamic trees with top trees, http://arxiv.org/abs/cs/0310065, 2003.
4. S. Altrup, J. Holm, K. de Lichtenberg, and M. Thorup. Minimizing diameters of dynamic trees. In Proc. of the 24th International Colloquium on Automata, Languages and Programming (ICALP), volume 1256 of Lecture Notes in Comp. Science, pages 270-280. Springer-Verlag, 1997.
5. S. W. Bent, D. D. Sleator, and R. E. Tarjan. Biased search trees. SIAM Journal of Computing, 14(3):545-568, 1985.
6. R. F. Cohen and R. Tamassia. Dynamic expression trees. Algorithmica, 13:329-346, 1995.
7. G. N. Frederickson. Data structures for on-line update of minimum spanning trees, with applications. SIAM Journal of Computing, 14(4):781-798, 1985.
8. G. N. Frederickson. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. SIAM Journal of Computing, 26(2):484-538, 1997.
9. G. N. Frederickson. A data structure for dynamically maintaining rooted trees. Journal of Algorithms, 24:37-65, 1997.
10. 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. Programming, 50:277-290, 1991.
11. A. V. Goldberg and R. E. Tarjan. A new approach to the maximum-flow problem. Journal of the ACM, 35(4):921-940, 1988.
12. M. R. Henzinger and V. King. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. Journal of the ACM, 46(4):502-516, 1999.
13. J. Holm and K. de Lichtenberg. Top-trees and dynamic graph algorithms. Technical Report DIKU-TR-98/17, Department of Computer Science, University of Copenhagen, 1998.
14. J. Holm, K. de Lichtenberg, and M. Thorup. Polylogarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Journal of the ACM, 48(4):723-760, 2001.
15. G. L. Miller and J. H. Reif. Parallel tree contraction and its applications. In Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, pages 478-489, 1985.
16. D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. Journal of Computer and System Sciences, 26(3):362-391, 1983.
17. D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652-686, 1985.
18. R. E. Tarjan. Amortized computational complexity. SIAM J. Alg. Disc. Meth., 6(2):306-318, 1985.
19. R. E. Tarjan. Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm. Mathematical Programming, 78(2): 169-177, 1997.