Introduction to algorithms
Randomized multidimensional search trees (extended abstract): dynamic sampling
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On-line maintenance of the four-components of a graph (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Maintaining the 3-edge-connected components of a graph on-line
SIAM Journal on Computing
Maintenance of 2- and 3-edge-connected components of graphs I
Discrete Mathematics - Special issue on combinatorics and algorithms
Separator based sparsification for dynamic planar graph algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Bounded incremental computation
Bounded incremental computation
Improved data structures for fully dynamic biconnectivity
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
LEDA: a platform for combinatorial and geometric computing
Communications of the ACM
Randomized dynamic graph algorithms with polylogarithmic time per operation
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Average case analysis of dynamic graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An empirical study of dynamic graph algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Experimental analysis of dynamic minimum spanning tree algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Average case analysis of dynamic geometric optimization
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Maintenance of Triconnected Components of Graphs (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Improved Sampling with Applications to Dynamic Graph Algorithms
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
Experimental analysis of dynamic algorithms for the single source shortest paths problem
Journal of Experimental Algorithmics (JEA)
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Implementations and experimental studies of dynamic graph algorithms
Experimental algorithmics
An Experimental Study of Dynamic Algorithms for Transitive Closure
Journal of Experimental Algorithmics (JEA)
Experimental analysis of dynamic all pairs shortest path algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Experimental analysis of dynamic all pairs shortest path algorithms
ACM Transactions on Algorithms (TALG)
An experimental study of algorithms for fully dynamic transitive closure
Journal of Experimental Algorithmics (JEA)
Maintaining dynamic minimum spanning trees: An experimental study
Discrete Applied Mathematics
Algorithms and theory of computation handbook
Hi-index | 0.00 |
The contributions of this paper are both of theoretical and of experimental nature. From the experimental point of view, we conduct an empirical study on some dynamic connectivity algorithms which where developed recently. In particular, the following implementations were tested and compared with simple algorithms: simple sparsification by Eppstein et al. and the recent randomized algorithm by Henzinger and King. In our experiments, we considered both random and non-random inputs. Moreover, we present a simplified variant of the algorithm by Henzinger and King, which for random inputs was always faster than the original implementation. For non-random inputs, simple sparsification was the fastest algorithm for small sequences of updates; for medium and large sequences of updates, the original algorithm by Henzinger and King was faster.From the theoretical point of view, we analyze the average case running time of simple sparsification and prove that for dynamic random graphs its logarithmic overhead vanishes.