related to References · 44Top tree → ACM, ACM Transactions, Addison-Wesley, Algorithms, Alstrup, Augmenting Data Structures, Binary Search Trees, Chapters, Charles, Clifford Stein, Computer Programming, Cormen, Fundamental Algorithms, Introduction, ISBN, Issue, Jacob Holm, Journal, July, Knuth
has application · 22Top tree → Cut, Expose, Finally, For, GOLDBERG ET AL, If, In, It, Link, Median, Merge, Proof, Queries, SLEATOR AND TARJAN, Some, Split, The, The Center, This, We
related to Dynamic Operations · 17Top tree → Cut, Expose, External Boundary Vertices, Forest Updates, If, Is, It, Link, Re, Removes, Root, T1, T2, The, Tv, Tw, Where
related to Implementation · 16Top tree → After, Alstrup, Amortized, Frederickson's Topology Trees, Fully Dynamic Trees, Jacob Holm, Kristian, Lichtenberg, Maintaining Information, Multilevel Partition, On, Sleator-Tarjan, Technical Report, Top, Top Trees, Top-trees
related to External links · 12Top tree → Adjusting Top Trees, Alstrup, Fully Dynamic Trees, Holm, Maintaining Information, Proc, Rotenberg, Ryhl, SoDA, Tarjan, Top Trees, Werneck
related to Using Multilevel Partitioning · 10Top tree → Any, Cluster Partition Tree CPT, CPT, CPTP, If, Only, Re, There, This, We
related to Non local search · 9Top tree → Choose, If, Internal, It, Search, Sometimes, The, There, User
related to Internal Operations · 5Top tree → Internal Operations, It, The, The Forest, Updates
related to Introduction · 5Top tree → Binary, Dynamic, Re, The, Top
is a · 1Top tree → data structure based on a binary tree for unrooted dynamic trees that is used mainly for various path-related operations
