Alberts, D., Cattaneo, G., Italiano, G., Nanni, U., and Zaroliagis, C. 1998. A software library of dynamic graph algorithms. In Proc. Workshop on Algorithms and Experiments - ALEX'98 (1998), pp. 129-136. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Algorithms and Experiments on Transitive Closure, Path Cover and .. - Abdeddaim (2000) (Correct)
....this paper we present a new incremental algorithm that maintains the transitive closure in O(km ) time. We have implemented our two algorithms in ANSI C and compared them to incremental transitive closure algorithm implementations given in the LEDA Extension Package on Dynamic Graph Algorithms [Alberts et al. 1998; Frigioni et al. 1998] The comparisons, done both on random graphs and alignment graphs, show that i) the two algorithms that use path cover knowledge are faster than the others, ii) the new algorithm is faster than the previous one ( Abdedda m 1997] when the number of paths covering the graph ....
....1986] in order to compare our two algorithms with an algorithm that maintains the transitive closure of a incremental graph without using a path cover. We also used for the comparison the implementation in C of di erent algorithms given in the LEDA Extension Package on Dynamic Graph Algorithms [Alberts et al. 1998; Frigioni et al. 1998] which is an extension of the Library of Ecient Data Types and Algorithms (LEDA) Mehlhorn and N aher 1995] Following Frigioni et al. Frigioni et al. 1998] algorithms that gives the best results for edge insertion operations with boolean transitive closure queries are ....
Alberts, D., Cattaneo, G., Italiano, G., Nanni, U., and Zaroliagis, C. 1998. A software library of dynamic graph algorithms. In Proc. Workshop on Algorithms and Experiments - ALEX'98 (1998), pp. 129-136.
An Experimental Study of Dynamic Algorithms for.. - Frigioni, Miller.. (2000) (2 citations) Self-citation (Nanni Zaroliagis) (Correct)
....likely to be fast in practice, since the involved implementation constants are usually very low. All the implementations have been written in C using the LEDA library for combinatorial and geometric computing [29] and constitute part of the LEDA Extension Package on Dynamic Graph Algorithms [3]. The source codes of our implementations, a demo program, and a graphic experimentation platform are available from http: www.ceid.upatras.gr faculty zaro software. Our experiments have been performed on random inputs (randomly generated graphs and operation sequences) non random inputs that ....
.... the reported path (recall that CFNP, CFNP Opt and Yellin do not support Path queries) 3 Experimental results All of our implementations were written as C classes using several advanced data types of LEDA [29] and constitute part of the LEDA Extension Package (LEP) on Dynamic Graph Algorithms [3]. Each class is derived from a new, especially designed, base class de ning a common interface for all classes. Every class is installed in an interface program that allows to read graphs and sequences from les, to perform operations, to store the results again on les and to show them on ....
[Article contains additional citation context not shown here]
D. Alberts, G. Cattaneo, G.F. Italiano, U. Nanni, and C. Zaroliagis. A software library of dynamic graph algorithms. In Proc. 1st Workshop on Algorithms and Experiments, pp. 129{ 136, 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