Abstract:
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. Work partly supported by the Commission of the European Communities under the ESPRIT-LTR Project
Citations
|
5825
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 2001
|
|
2004
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
1289
|
The Probabilistic Method
– Alon, Spencer
- 1992
|
|
1154
|
Random graphs
– Bollobás
- 1985
|
|
550
|
LEDA: A Platform for Combinatorial and Geometric Computing
– Mehlhorn, Näher
- 2000
|
|
274
|
Computational Geometry. An introduction through randomized algorithms
– Mulmuley
- 1994
|
|
137
|
Data structures for on-line updating of minimum spanning trees, with applications
– Frederickson
- 1985
|
|
111
|
Sparsification - a technique for speeding up dynamic graph algorithms
– Eppstein, Galil, et al.
- 1992
|
|
73
|
Ambivalent data structures for dynamic 2-edgeconnectivity and k smallest spanning trees
– Frederickson
- 1991
|
|
44
|
Linear time algorithms for finding a sparse k-connected spanning subgraph of a k-connected graph
– NAGAMOCHI, IBARAKI
- 1992
|
|
41
|
Randomized dynamic graph algorithms with polylogarithmic time per operation
– Henzinger, King
- 1995
|
|
38
|
Randomized, multidimensional search trees: dynamic sampling
– Mulmuley
- 1991
|
|
34
|
ªMaintaining Bridge-Connected and Biconnected Components On-Line,º Algorithmica
– Westbrook, Tarjan
- 1992
|
|
32
|
Bounded incremental computation
– Ramalingam
- 1993
|
|
32
|
ªImproved Data Structures for Fully Dynamic Biconnectivity,º
– Rauch
- 1994
|
|
27
|
Seperator based sparsification for dynamic planar graph algorithms
– Eppstein, Galil, et al.
- 1993
|
|
24
|
J.Chen: On-line maintenance of the four-connected components of a graph (extended abstract
– Kanevsky, Battista
- 1991
|
|
17
|
Fully dynamic biconnectivity in graphs
– Rauch
- 1992
|
|
15
|
Experimental analysis of dynamic minimum spanning tree algorithms
– Amato, Cattaneo, et al.
- 1997
|
|
13
|
Improved sampling with applications to dynamic graph algorithms
– Henzinger, Thorup
- 1996
|
|
11
|
Average case analysis of dynamic graph algorithms
– Alberts, Henzinger
- 1995
|
|
11
|
Dynamic Maintenance of Convex Polytopes and Related Structures
– Schwarzkopf
- 1992
|
|
10
|
Average case analysis of dynamic geometric optimization
– Eppstein
- 1996
|
|
6
|
Maintaining the 3-edge-connected components of a graph on-line
– Galil, Italiano
- 1993
|
|
5
|
Fully dynamic cycle equivalence in graphs
– Henzinger
- 1994
|
|
5
|
LEDA user manual (version 3.0
– Naher
- 1994
|
|
4
|
Maintaining the 4-edge-connected components of a graph on-line
– Dinitz
- 1993
|
|
2
|
Implementation of the dynamic connectivity algorithm by Henzinger and King
– Alberts
- 1995
|
|
1
|
La Poutr'e, "Maintenance of triconnected components of graphs
– A
- 1992
|
|
1
|
Overmars, "Maintenance of 2- and 3connected components of Graphs, Part I: 2- and 3-edge-connected components", Discrete Mathematics 114
– Poutr'e, Leeuwen, et al.
- 1993
|
|
