A data structure for dynamic trees
Journal of Computer and System Sciences
A generalized algorithm for centrality problems on trees
Journal of the ACM (JACM)
The cell probe complexity of dynamic data structures
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Use of dynamic trees in a network simplex algorithm for the maximum flow problem
Mathematical Programming: Series A and B
On-line maintenance of the four-components of a graph (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Dynamic expression trees and their applications
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Alpha-algorithms for incremental planarity testing (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Randomized dynamic graph algorithms with polylogarithmic time per operation
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Dynamic and static algorithms for optimal placement of resources in a tree
Theoretical Computer Science
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
SIAM Journal on Computing
Implementation of dynamic trees with in-subtree operations
Journal of Experimental Algorithmics (JEA)
Isomorphism testing and display of symmetries in dynamic trees
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On-Line Graph Algorithms with SPQR-Trees
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Maintaining Biconnected Components of Dynamic Planar Graphs
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Maintenance of Triconnected Components of Graphs (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Minimizing Diameters of Dynamic Trees
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Maintaining Tree Projections in Amortized $O$(log $n$) Time.
Maintaining Tree Projections in Amortized $O$(log $n$) Time.
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Improved Algorithms for Finding Level Ancestors in Dynamic Trees
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The Conditional Location of a Median Path
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
The tree inclusion problem: In linear space and faster
ACM Transactions on Algorithms (TALG)
A new template for solving p-median problems for trees in sub-quadratic time
ESA'05 Proceedings of the 13th annual European conference on Algorithms
General compact labeling schemes for dynamic trees
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Tree compression with top trees
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
We show how to maintain centers and medians for a collection of dynamic trees where edges may be inserted and deleted and node and edge weights may be changed. All updates are supported in O(log n) time, where n is the size of the tree(s) involved in the update.