We present fully dynamic algorithms for maintaining the biconnected components in general and plane graphs. A fully dynamic algorithm maintains a graph during a sequence of insertions and deletions of edges or isolated vertices. Let m be the number of edges and n be the number of vertices in a graph. The time per operation of the previously best deterministic algorithms were O(min{m
|
684
|
Graph Theory
– Harary
- 1971
|
|
221
|
Fast algorithms for finding nearest common ancestors
– Harel, Tarjan
- 1984
|
|
215
|
A data structure for dynamic trees
– Sleator, Tarjan
- 1983
|
|
137
|
Data structures for on-line updating of minimum spanning trees, with applications
– Frederickson
- 1985
|
|
132
|
Data Structures and Algorithms 1: Sorting and Searching
– Mehlhorn
- 1984
|
|
111
|
Sparsification - a technique for speeding up dynamic graph algorithms
– Eppstein, Galil, et al.
- 1992
|
|
93
|
Data structures for weighted matching and nearest common ancestors with linking
– Gabow
- 1990
|
|
73
|
Ambivalent data structures for dynamic 2-edgeconnectivity and k smallest spanning trees
– Frederickson
- 1991
|
|
54
|
Maintenance of a minimum spanning forest in a dynamic planar graph
– Eppstein, Italiano, et al.
- 1990
|
|
41
|
Randomized dynamic graph algorithms with polylogarithmic time per operation
– Henzinger, King
- 1995
|
|
32
|
ªImproved Data Structures for Fully Dynamic Biconnectivity,º
– Rauch
- 1994
|
|
31
|
Improved sparsification
– Eppstein, Galil, et al.
- 1993
|
|
28
|
Lower bounds for fully dynamic connectivity problems in graphs. AIgorithmica
– Fredman, Henzinger
- 1998
|
|
27
|
Seperator based sparsification for dynamic planar graph algorithms
– Eppstein, Galil, et al.
- 1993
|
|
23
|
Tarjan, "A Data Structure for Dynamic Trees
– Sleator, E
- 1983
|
|
20
|
Maintaining minimum spanning trees in dynamic graphs
– Henzinger, King
- 1997
|
|
13
|
Improved sampling with applications to dynamic graph algorithms
– Henzinger, Thorup
- 1996
|
|
13
|
Tarjan, "Fast algorithms for finding nearest common ancestors
– Harel, E
- 1984
|
|
11
|
Complexity models for incremental computation, Theoretical computer Science
– Miltersen, Subramanian, et al.
- 1994
|
|
8
|
Fully dynamic algorithms for edge connectivity problems
– Galil, Italiano
- 1991
|
|
8
|
Certificates and fast algorithms for biconnectivity in fully dynamic graphs
– Henzinger, Poutr'e
- 1995
|
|
8
|
Fully dynamic biconnectivity in graphs
– HENZINGER
- 1995
|
|
5
|
Fully Dynamic 2--Edge--Connectivity in Planar Graphs
– Hershberger, Rauch, et al.
- 1992
|
|
5
|
Fully Dynamic Algorithms for 2-Edge Connectivity
– Galil, Italiano
- 1992
|
|
4
|
Complexity Models for Incremental Computation", Theoret
– Miltersen, Subramanian, et al.
- 1994
|
|
2
|
Fully Dynamic Biconnectivity in Graphs”, Algorithmica 13
– Henzinger
- 1995
|
|
2
|
Poutré, “Certificates and Fast Algorithms for Biconnectivity
– Henzinger, La
- 1995
|
|
2
|
Fully Dynamic 2–Edge–Connectivity
– Hershberger, Rauch, et al.
- 1992
|
|
1
|
Fully Dynamic Biconnectivity in Graphs", Algorithmica 13
– Henzinger
- 1995
|
|
1
|
Separator-based sparsification II: Edge and vertex connectivity
– Eppstein, Galil, et al.
- 1999
|
|
1
|
Poly-logarithmic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
– Holm, Lichtenberg, et al.
- 1998
|
|
