Searching for "A Data Structure for Dynamic Trees" – sorted by Relevance.
7 documents found, showing 1 through 7.
-
Dynamizing Static Algorithms, with Applications to Dynamic Trees and History Independence
- … of Miller and Reif to obtain a history-independent data structure for the dynamic trees problem of Sleator…
- Cited by 30 (19 self) – Add To MetaCart
-
Maintaining information in fully-dynamic trees with top trees
- …–538, 1997] or with Sleator and Tarjan’s dynamic trees [A Data Structure for Dynamic Trees. J. Comput. Syst…
- Cited by 8 (0 self) – Add To MetaCart
-
Randomized Dynamic Graph ALgorithms with Polylogarithmic Time per Operation
- …. Tarjan, "A data structure for dynamic trees" J. Consput. System Sci. 24, 1983, 362 381. [19] P.M. Spira…
- Cited by 39 (9 self) – Add To MetaCart
-
Top-Trees and Dynamic Graph Algorithms
- … and an overview of previous solutions. 3 In many dynamic graph algorithms, a data structure for dynamic trees…
- Cited by 2 (0 self) – Add To MetaCart
-
Adaptive Memoization
- … that the tree contraction algorithm of Miller and Reif yields a data structure for the dynamic-trees problem…
- Cited by 3 (1 self) – Add To MetaCart
-
Speed-ups in Constructive Solid Geometry
- … on a data structure, the dwarf CSG tree, which enables him to change the value of a single variable…
- Add To MetaCart
-
Near-entropy hotlink assignments
- … data structure for the Dynamic trees problem [16]. Namely, we are given a collection of vertex…
- Cited by 1 (0 self) – Add To MetaCart
Showing 1 through 7.
