Searching for "Dynamic Tree Algorithms" – sorted by Relevance.
18 documents found, showing 1 through 10.
Next 10 →
-
Top-Trees and Dynamic Graph Algorithms
- … Universitetsparken 1 DK-2100 KBH DENMARK October 1998 Top-trees and dynamic graph algorithms Jacob Holm Kristian de…
- Cited by 2 (0 self) – Add To MetaCart
-
Dynamizing Static Algorithms, with Applications to Dynamic Trees and History Independence
- …Dynamizing Static Algorithms, with Applications to Dynamic Trees and History Independence ∗ Umut A…
- Cited by 30 (19 self) – Add To MetaCart
-
Competitive On-Line Stream Merging Algorithms for Media-on-Demand
- … merging algorithms called dynamic tree algorithms. The bandwidth requirements of the best of these…
- Cited by 19 (3 self) – Add To MetaCart
-
A Simple Randomized Algorithm for the Fixed Frequency Assignment Problem
- … on the construction of a solution using a "dynamic" tree. Then, performances of this algorithm are evaluated…
- Add To MetaCart
-
Comparison Of Contention Resolution Algorithms For A Cable Modem Mac Protocol
- …-trip changes dynamically. The tree algorithm requires a separate interleave for every CMS in the round trip…
- Cited by 2 (0 self) – Add To MetaCart
-
Faster Circle Packing with Application to Nonobtuse Triangulation
- … the dynamic tree algorithm. Assume without loss of generality C ′ is in the component containing y. We…
- Cited by 8 (3 self) – Add To MetaCart
-
Batch Conflict Resolution Algorithm with Progressively Accurate Multiplicity Estimation
- … tree algorithm. The dynamic tree algorithm is tailored to the Poisson arrivals of messages. In fact…
- Cited by 4 (0 self) – Add To MetaCart
-
Algorithm, Design, Performance
- … tree algorithm. The dynamic tree algorithm is tailored to the Poisson arrivals of messages. In fact…
- Add To MetaCart
-
Active graph cuts
- … system of dynamic trees. The algorithm outputs a minimum cost cut when excesses become completely…
- Cited by 13 (2 self) – Add To MetaCart
-
Heuristics for the K-Cardinality Tree and Subgraph Problems
- …] for Kcardinality subtrees of trees. This algorithm will be called DynamicTree. For an implementation…
- Cited by 9 (1 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
