Poly-logarithmic deterministic fully-dynamic graph algorithms I: connectivity and minimum spanning tree

Poly-logarithmic deterministic fully-dynamic graph algorithms I: connectivity and minimum spanning tree (1997)

by Jacob Holm , Kristian de Lichtenberg , Mikkel Thorup

Venue:	JOURNAL OF THE ACM
Citations:	154 - 7 self

163	Data structures for on-line updating of minimum spanning trees - Frederickson - 1985
137	Sparsification, a technique for speeding up dynamic graph algorithms - Eppstein, Galil, et al. - 1992
70	Randomized fully dynamic graph algorithms with polylogarithmic time per operation. - HENZINGER, KING - 1999
45	Fully dynamic transitive closure: Breaking through the O(n2) barrier. - DEMETRESCU, ITALIANO - 2000
38	Dynamic Euclidean minimum spanning trees and extrema of binary functions - Eppstein - 1995
36	Lower bounds for fully dynamic connectivity problems in graphs. - FREDMAN, HENZIGER - 1997
31	Minimizing diameters of dynamic trees, in: - Alstrup, Holm, et al. - 1997
28	Efficient algorithms for Petersen’s matching theorem - Biedl, Bose, et al.
28	Maintaining minimum spanning trees in dynamic graphs. - HENZINGER, KING - 1997
17	Unique maximum matching algorithms - Gabow, Kaplan, et al.
5	Fully dynamic 2-edge connectivity algorithm in polylogarithmic time per operation - Henzinger, King - 1997
2	Fully dynamic biconnectivity in graphs. Algorithmica 13, 6, 503–538. (Announced at FOCS - HENZINGER - 1995