Years and Authors of Summarized Original Work
2001; Holm, de Lichtenberg, Thorup
Problem Definition
Design a data structure for an undirected graph with a fixed set of nodes which can process queries of the form “Are nodes i and j connected?” and updates of the form “Insert edge {i,j}”; “Delete edge {i,j}.” The goal is to minimize update and query times, over the worst-case sequence of queries and updates. Algorithms to solve this problem are called “fully dynamic” as opposed to “partially dynamic” since both insertions and deletions are allowed.
Key Results
Holm et al. [4] gave the first deterministic fully dynamic graph algorithm for maintaining connectivity in an undirected graph with polylogarithmic amortized time per operation, specifically, O(log2n) amortized cost per update operation and O(logn∕loglogn) worst-case per query, where n is the number of nodes. The basic technique is extended to maintain minimum spanning trees in O(log4n) amortized cost per update operation and...
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
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
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)
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)
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)
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)
Pătraşcu M, Demaine E (2006) Logarithmic lower bounds in the cell-probe model. SIAM J Comput 35(4):932–963. (Presented at ACM STOC 2004)
Thorup M (2000) Near-optimal fully-dynamic graph connectivity. In: Proceedings of the 32nd ACM symposium on theory of computing, Portland. ACM STOC, pp 343–350
Thorup M (2000) Dynamic Graph Algorithms with Applications. In: Halldórsson MM (ed) 7th Scandinavian workshop on algorithm theory (SWAT), Norway, 5–7 July 2000, pp 1–9
Zaroliagis CD (2002) Implementations and experimental studies of dynamic graph algorithms. In: Experimental algorithmics, Dagstuhl seminar, Sept 2000. Lecture notes in computer science, vol 2547. Springer. Journal article: J Exp Algorithmics 229–278 (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
King, V. (2016). Fully Dynamic Connectivity. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_152
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_152
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering