Fully Dynamic Connectivity
Publisher
Springer New York
Reference9 articles.
1. Eppstein D, Galil Z, Italiano GF, Nissenzweig A (1997) Sparsification-a technique for speeding up dynamic graph algorithms. J ACM 44(5):669–696.1
2. Henzinger MR, King V (1999) Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J ACM 46(4):502–536. (Presented at ACM STOC 1995)
3. Henzinger MR, Thorup M (1997) Sampling to provide or to bound: with applications to fully dynamic graph algorithms. Random Struct Algorithms 11(4):369–379. (Presented at ICALP 1996)
4. Holm J, De Lichtenberg K, Thorup M (2001) Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-Edge, and biconnectivity. J ACM 48(4):723–760. (Presented at ACM STOC 1998)
5. Iyer R, Karger D, Rahul H, Thorup M (2001) An experimental study of poly-logarithmic fully-dynamic connectivity algorithms. J Exp Algorithmics 6(4). (Presented at ALENEX 2000)