Abstract
In this paper we describe robust and efficient implementations of two graph connectivity algorithms. The implementations are based on the LEDA library of efficient data types and algorithms [18,19]. Moreover, we provide experimental evaluations of the implemented algorithms and we compare their performance to other graph connectivity algorithms currently implemented in LEDA.
The first algorithm is the Karp and Tarjan algorithm [16] for finding the connected components of an undirected graph. The algorithm achieves to find the connected components of a graph G = 〈V,E〉 in O(|V |) expected time. This is the first expected-time algorithm for the static graph connectivity problem implemented in LEDA. The experimental evaluation of the algorithm proves that the algorithm performs well in practice, and establishes that theoretical and experimental results converge. The standard procedure provided by LEDA for finding the connected components of a graph, called COMPONENTS has running time O(|V | + |E|). We have compared the performance of Karp and Tarjan’s algorithm to the one of COMPONENTS and we have proved that there exists a wide class of graphs (those that they are dense) that the performance of the first algorithm dramatically improves upon the one of the second.
The second implemented algorithm is the Nikoletseas, Reif, Spirakis and Yung polylogarithmic algorithm [20] for dynamic graph connectivity. The algorithm can cope with any random sequence of three kinds of operations: insertions, deletions and queries. The experimental evaluation of the algorithm proves that it is very efficient for particular classes of graphs. Comparing the performance of the implemented algorithm to the one of other dynamic connectivity algorithms implemented in LEDA, we conclude that the algorithm always performs better than all these algorithms for dense random graphs and random sequences of operations. Moreover, it works very efficiently even for sparse random graphs when the sequence of operations is long.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
D. Alberts, G. Cattaneo and G. Italiano, “An Empirical Study of Dynamic Algorithms,” ACM Journal of Experimental Algorithmics, Vol. 2, No. 5, pp. 192–201, 1997.
G. Amato, G. Cattaneo and G. Italiano, “Experimental Analysis of Dynamic Minimum Spanning Tree Algorithms,” Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 314–323, January 1997.
G. Amato, G. Cattaneo, G. F. Italiano, U. Nanni and C. Zaroliagis, “A Software Library of Dynamic Graph Algorithms,” Proceedings of the Workshop on Algorithms and Experiments (ALEX’98), pp. 129–136, February 1998.
D. Alberts and M. Henzinger, “Average Case Analysis of Dynamic Graph Algorithms,” Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 312–321, 1995.
Bela Bollobas, Random Graphs, Academic Press, 1985.
T. Cormen, C. Leiserson and R. Rivest, Introduction to Algorithms, MIT Press/McGraw-Hill Book company, 1990.
D. Eppstein, Z. Galil, G. Italiano and T. Spencer, “Separator Based Sparsification for Dynamic Planar Graph Algorithms,” Journal of Computer and System Science, Vol. 52, No. 1, pp. 3–27, 1996.
D. Epstein, Z. Galil, G. Italiano and A. Nissenweig, “Sparsification-A Technique for Speeding Up Dynamic Graph Algorithms,” Journal of ACM, Vol. 44, pp. 669–696, 1997.
P. Erdos and A. Renyi, “On the evolution of random graphs,” Magyar Tud. Akad. Math. Kut. Int. Kozl., 5, pp. 17–61, 1960.
P. Fatourou, P. Spirakis, P. Zarafidis and A. Zoura, “Implementation and Experimental Evaluation of Graph Connectivity Algorithms using LEDA,” http://students.ceid.upatras.gr/~faturu/projects.htm
G. Frederickson, “Data Structures for On-Line Updating of Minimum Spanning Trees,” SIAM Journal of Computing, Vol. 14, pp. 781–798, 1985.
G. Frederickson, “Ambivalent data structures for dynamic 2-edge connectivity and k-smallest spanning trees,” Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science (FOCS’91), pp. 632–641, 1991.
D. Frigioni, T. Miller, U. Nanni, G. Pasqualone, G. Schaefer and C. Zaroliagis, “An Experimental Study of Dynamic Algorithms for Directed Graphs,” Proceedings of the 6th Annual European Symposium on Algorithms (ESA’98), pp. 368–380, August 1998.
Z. Galil and G. Italiano, “Fully dynamic algorithms for edge-connectivity problems,” Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC’91), pp. 317–327, May 1991.
M. Henzinger and V. King, “Randomized Graph Algorithms with Polylogarithmic Time per Operation,” Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC’95), pp. 519–527, 1995.
R. Karp and R. Tarjan, “Linear Expected Time for Connectivity Problems,” Journal of Algorithms, Vol. 1, pp. 374–393, 1980.
“LEDA Extension Package Dynamic Graph Algorithms”, User Manual, Version 3.8, 1998.
K. Mehlhorn and S. Naher, “LEDA, A platform for combinatorial and geometric computing ” Communications of the ACM, 1995.
K. Mehlhorn and S. Naher, The LEDA Platform of Combinatorial and Geometric Computing, Cambridge University Press, 1999.
S. Nikoletseas, J. Reif, P. Spirakis and M. Yung, “Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time,” Proceedings of the 22nd International Colloquium on Automata, Languages, and Programming (ICALP’95), pp. 159–170, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fatourou, P., Spirakis, P., Zarafidis, P., Zoura, A. (1999). Implementation and Experimental Evaluation of Graph Connectivity Algorithms Using LEDA. In: Vitter, J.S., Zaroliagis, C.D. (eds) Algorithm Engineering. WAE 1999. Lecture Notes in Computer Science, vol 1668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48318-7_12
Download citation
DOI: https://doi.org/10.1007/3-540-48318-7_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66427-7
Online ISBN: 978-3-540-48318-2
eBook Packages: Springer Book Archive