Abstract:
Introduction In many applications of graph algorithms, including communication networks, graphics, assembly planning, and VLSI design, graphs are subject to discrete changes, such as additions or deletions of edges or vertices. In the last decade there has been a growing interest in such dynamically changing graphs, and a whole body of algorithms and data structures for dynamic graphs has been discovered. This chapter is intended as an overview of this field. In a typical dynamic graph problem one would like to answer queries on graphs that are undergoing a sequence of updates, for instance, insertions and deletions of edges and vertices. The goal of a dynamic graph algorithm is to update efficiently the solution of a problem after dynamic changes, rather than having to recompute it from scratch each time. Given their powerful versatility, it is not surprising that dynamic algorithms and dynamic data structures are often more difficult to design and analyze than their static c
Citations
|
704
|
Graph Theory
– Harary
- 1972
|
|
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
|
|
76
|
Incremental planarity testing
– Battista, Tamassia
- 1989
|
|
70
|
Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees
– Frederickson
- 1991
|
|
57
|
Incremental algorithms for minimal length paths
– Ausiello, Italiano, et al.
- 1991
|
|
56
|
Maintenance of a minimum spanning forest in a dynamic plane graph
– Eppstein, Italiano, et al.
- 1992
|
|
43
|
Fully dynamic biconnectivity and transitive closure
– Henzinger, King
- 1995
|
|
39
|
Randomized dynamic graph algorithms with polylogarithmic time per operation
– Henzinger, King
- 1995
|
|
35
|
Updating distances in dynamic graphs
– Even, Gazit
- 1985
|
|
25
|
An empirical study of dynamic graph algorithms
– Alberts, Cattaneo, et al.
- 1997
|
|
25
|
Lower bounds for fully dynamic connectivity problems in graphs. Manuscript, to appear in Algorithmica. A preliminary version appears as "Improved data structures for fully dynamic biconnectivity
– Fredman, Henzinger
- 1994
|
|
23
|
Separator Based Sparsification for Dynamic Planar Graph Algorithms
– Eppstein, Galil, et al.
- 1993
|
|
22
|
Dynamic expression trees and their applications
– Cohen, Tamassia
- 1991
|
|
22
|
On-line graph algorithms with SPQR-trees
– Battista, Tamassia
- 1990
|
|
20
|
Fully dynamic output bounded single source shortest path problem
– Frigioni, Marchetti-Spaccamela, et al.
- 1996
|
|
18
|
Efficient Algorithms for Graphic Matroid Intersection and Parity
– Gabow, Stallmann
- 1985
|
|
16
|
Fully dynamic planarity testing
– Galil, Italiano, et al.
- 1992
|
|
14
|
Algorithms for updating minimum spanning trees
– Chin, Houck
- 1978
|
|
8
|
Maintaining the 3-edge-connected components of a graph on-line
– Galil, Italiano
|
|
8
|
Certificates and fast algorithms for biconnectivity in fully dynamic graphs
– Henzinger, Poutr'e
- 1995
|
|
4
|
Scan-first search and sparse certificates---an improved parallel algorithm for k-vertex connectivity
– Cheriyan, Kao, et al.
- 1993
|
|
4
|
Maintaining the 4-edge-connected components of a graph on-line
– Dinitz
- 1993
|
|
4
|
Fully dynamic algorithms for 2-edge-connectivity
– Galil, Italiano
- 1992
|
|
4
|
Italiano: Decremental 2- and 3-Connectivity on Planar Graphs. Algorithmica 16(3
– Giammarresi, Italiano
- 1996
|
|
3
|
Clustering for faster network simplex pivots
– Eppstein
- 1994
|
