Boyar, J., Fagerberg, R., Larsen, K.: "Amortization Results for Chromatic Search Trees, with an Application to Priority Queues"; 4th International Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, 955 (1995), 270--281.  Home/Search   Document Details and Download   Summary   Related Articles

....of red black trees which they call a chromatic tree. Boyar and Larsen [5] analyze the proposal of [13] and show that after a minor modification the number of rebalancing operations per update is O(log(n i) if i insertions are performed on a tree which initially contains n leaves. Boyar et al. [3] prove for a slightly modified set of rebalancing operations that only an amortized constant amount of rebalancing is necessary after an update in a chromatic tree. In [21] Soisalon Soininen and Widmayer propose a relaxed version of AVL trees which fulfills, despite the local nature of its ....

....relaxed balancing by expanding the standard balancing technique. Now we show how to tune this algorithm for relaxed balanced red black trees by choosing the surrounding area as small as possible. As result we will obtain the rebalancing transformations for chromatic trees proposed by Boyar et al. [3]. Let the vicinity of an up in or an up out request of a node p denote the set of neighbouring nodes the colours of which have to be changed or which will obtain new subtrees by the transformation explained in Section 2 that settles the request of p. Note that in accordance with our definition ....

[Article contains additional citation context not shown here]

Boyar, J., Fagerberg, R., Larsen, K.: "Amortization Results for Chromatic Search Trees, with an Application to Priority Queues"; 4th International Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, 955 (1995), 270--281.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC