Design and Analysis of Data Structures for Dynamic Trees

@inproceedings{Werneck2006DesignAA,
  title={Design and Analysis of Data Structures for Dynamic Trees},
  author={Renato F. Werneck},
  year={2006}
}
The dynamic trees problem is that of maintaining a forest that changes over time through edge insertions and deletions. We can associate data with vertices or edges and manipulate this data, individually or in bulk, with operations that deal with whole paths or trees. Efficient solutions to this problem have numerous applications, particularly in algorithms for network flows and dynamic graphs in general. Several data structures capable of logarithmic-time dynamic tree operations have been… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS