Maintaining Center and Median in Dynamic Trees

Abstract. 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.

• Type: Conference
• Year: 2000
• Where: SWAT
• Authors: Stephen Alstrup, Jacob Holm, Mikkel Thorup
• Keywords: Algorithms, Dynamic Trees, Edge Weights, Medians, SWAT 2000