"LEDA Extension Package Dynamic Graph Algorithms", User Manual, Version 3.8, 1998.  Home/Search   Document Not in Database   Summary   Related Articles

....of theoretical results. However, it seems that the implementation and experimental studies of this kind of algorithms are on the opposite poor. It is only recently that some of these algorithms have been implemented in C and tested under the LEDA Extension Package Dynamic Algorithms (LEPDGA) [17]. To the best of our knowledge, the only results towards this direction are two papers by G. Amato, G. Cattaneo and G. Italiano [2] and D. Alberts, G. Cattaneo and G. Italiano [1] respectively. In the first of these works, they implemented and tested Frederickson s algorithms [12] and compared ....

.... n) O(log 3 n) O(1) dc henzinger king O(log 3 n) O(log 3 n) O(log n) dc simple O(n m) O(n m) O(1) Figure 2: Theoretical bounds on the performance of each algorithm During the retirement epoch, the algorithm by Henziger and King (that is, the data structure dc henzinger king of LEP DGA [17]) is used for performing each operation. The correctness of the implementation has been checked by comparing the answers to the queries in sequences of random operations among NRSY and other already implemented algorithms in LEDA. Additionally, we have performed tests with random updates, and ....

[Article contains additional citation context not shown here]

"LEDA Extension Package Dynamic Graph Algorithms", User Manual, Version 3.8, 1998.

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