Abstract:
We report on a software library of dynamic graph algorithms. It was written in C++ as an extension of LEDA, the library of efficient data types and algorithms. It contains implementations of simple data structures as well as of sophisticated data structures for dynamic connectivity, dynamic minimum spanning trees, dynamic single source shortest paths, and dynamic transitive closure. All data structures are implemented by classes derived from a common base class, thus they have a common interface. Additionally, the base class is in charge of keeping all dynamic data structures working on the same graph consistent. It is possible to change the structure of a graph by a procedure which is not aware of the dynamic data structures initialized for this graph. The library is easily extendible. 1 Introduction Traditional graph algorithms operate on static graphs. A fixed graph is given, and an algorithmic problem (e.g., "Is the graph planar?") is solved on the graph. Dynamic graphs are not fi...
Citations
|
3853
|
Design Patterns: Elements of Reusable Object-Oriented Software
– Gamma, Helm, et al.
- 1995
|
|
551
|
note on two problems in connection with graphs
– Dijkstra
- 1959
|
|
545
|
LEDA - A Platform for Combinatorial and Geometric
– Mehlhorn, Naher
- 1996
|
|
412
|
Fibonacci heaps and their uses in improved network optimization algorithms
– Fredman, Tarjan
- 1987
|
|
250
|
On the shortest spanning subtree of a graph and the traveling salesman problem
– Kruskal
- 1956
|
|
218
|
A data structure for dynamic trees
– SLEATOR, TARJAN
- 1981
|
|
130
|
Data structures for on-line updating of minimum spanning trees
– Frederickson
- 1983
|
|
104
|
Sparsification—a technique for speeding up dynamic graph algorithms
– Eppstein, Galil, et al.
- 1997
|
|
85
|
T.W.: An incremental algorithm for a generalization of the shortest-path problem
– Ramalingam, Reps
- 1996
|
|
70
|
Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees
– Frederickson
- 1991
|
|
43
|
Fully dynamic biconnectivity and transitive closure
– Henzinger, King
- 1995
|
|
39
|
Randomized dynamic graph algorithms with polylogarithmic time per operation
– Henzinger, King
- 1995
|
|
37
|
Undirected single source shortest paths in linear time
– Thorup
- 1997
|
|
32
|
Maintenance of transitive closure and transitive reduction of graphs
– Poutré, Leeuwen
- 1988
|
|
30
|
Amortized efficiency of a path retrieval data structure
– Italiano
|
|
29
|
Finding paths and deleting edges in directed acyclic graphs
– Italiano
- 1988
|
|
25
|
An empirical study of dynamic graph algorithms
– Alberts, Cattaneo, et al.
- 1997
|
|
23
|
Speeding up dynamic transitive closure for bounded degree graphs
– Yellin
- 1993
|
|
21
|
Recent results on the single-source shortest paths problem
– Raman
- 1997
|
|
20
|
Fully dynamic output bounded single source shortest path problem
– Frigioni, Marchetti-Spaccamela, et al.
- 1996
|
|
14
|
Experimental analysis of dynamic algorithms for the single-source shortest path problem
– Frigioni, Ioffreda, et al.
- 1998
|
|
13
|
Experimental analysis of dynamic minimum spanning tree algorithms
– Amato, Cattaneo, et al.
- 1997
|
|
9
|
Improved sampling with applications to dynamic graph algorithms
– Henzinger, Thorup
- 1996
|
|
2
|
Counting edges in a digraph
– Cicerone, Frigioni, et al.
- 1996
|
|
1
|
A First Experimental Study of a Dynamic Transitive Closure Algorithm
– Miller, Zaroliagis
- 1997
|
|
