A Data Structure for Dynamically Maintaining Rooted Trees

Abstract

Chapter 20 Dynamically Maintaining Rooted Trees* Greg N. Fredericksont The directed topology tree data structure is developed for maintaining binary trees dynamically. Each of a certain set of tree operations is shown to take O(log n) time, where n is the number of vertices in the trees. The directed topology trees are used to implement link-cut trees and… (More)
DOI: 10.1006/jagm.1996.0835

Topics

4 Figures and Tables

Statistics

051015'95'98'01'04'07'10'13'16
Citations per Year

96 Citations

Semantic Scholar estimates that this publication has 96 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics