Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA
Lists
Only you see this
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.
BibTeX
@inproceedings{fatourou1999implementation,
author = {Panagiota Fatourou and Paul G. Spirakis and Panagiotis Zarafidis and Anna Zoura},
title = {{Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA}},
booktitle = {WAE},
year = {1999},
url = {https://openreview.net/forum?id=58Gg1FMGJn},
}Loading related content...