{"page":"351-362","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","acknowledgement":".","citation":{"ama":"Henzinger MH, Fredman ML. Lower bounds for fully dynamic connectivity problems in graphs. <i>Algorithmica</i>. 1998;22(3):351-362. doi:<a href=\"https://doi.org/10.1007/pl00009228\">10.1007/pl00009228</a>","mla":"Henzinger, Monika H., and M. L. Fredman. “Lower Bounds for Fully Dynamic Connectivity Problems in Graphs.” <i>Algorithmica</i>, vol. 22, no. 3, Springer Nature, 1998, pp. 351–62, doi:<a href=\"https://doi.org/10.1007/pl00009228\">10.1007/pl00009228</a>.","short":"M.H. Henzinger, M.L. Fredman, Algorithmica 22 (1998) 351–362.","ieee":"M. H. Henzinger and M. L. Fredman, “Lower bounds for fully dynamic connectivity problems in graphs,” <i>Algorithmica</i>, vol. 22, no. 3. Springer Nature, pp. 351–362, 1998.","chicago":"Henzinger, Monika H, and M. L. Fredman. “Lower Bounds for Fully Dynamic Connectivity Problems in Graphs.” <i>Algorithmica</i>. Springer Nature, 1998. <a href=\"https://doi.org/10.1007/pl00009228\">https://doi.org/10.1007/pl00009228</a>.","ista":"Henzinger MH, Fredman ML. 1998. Lower bounds for fully dynamic connectivity problems in graphs. Algorithmica. 22(3), 351–362.","apa":"Henzinger, M. H., &#38; Fredman, M. L. (1998). Lower bounds for fully dynamic connectivity problems in graphs. <i>Algorithmica</i>. Springer Nature. <a href=\"https://doi.org/10.1007/pl00009228\">https://doi.org/10.1007/pl00009228</a>"},"date_created":"2022-07-28T06:58:36Z","month":"11","author":[{"last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"last_name":"Fredman","full_name":"Fredman, M. L.","first_name":"M. L."}],"doi":"10.1007/pl00009228","_id":"11681","publication":"Algorithmica","publication_status":"published","abstract":[{"lang":"eng","text":"We prove lower bounds on the complexity of maintaining fully dynamic k -edge or k -vertex connectivity in plane graphs and in (k-1) -vertex connected graphs. We show an amortized lower bound of Ω (log n / {k (log log n} + log b)) per edge insertion, deletion, or query operation in the cell probe model, where b is the word size of the machine and n is the number of vertices in G . We also show an amortized lower bound of Ω (log n /(log log n + log b)) per operation for fully dynamic planarity testing in embedded graphs. These are the first lower bounds for fully dynamic connectivity problems."}],"volume":22,"date_updated":"2022-09-12T09:03:36Z","type":"journal_article","extern":"1","publication_identifier":{"eissn":["1432-0541"],"issn":["0178-4617"]},"article_type":"original","year":"1998","publisher":"Springer Nature","day":"01","date_published":"1998-11-01T00:00:00Z","keyword":["Dynamic planarity testing","Dynamic connectivity testing","Lower bounds","Cell probe model"],"title":"Lower bounds for fully dynamic connectivity problems in graphs","scopus_import":"1","quality_controlled":"1","issue":"3","oa_version":"None","intvolume":"        22","language":[{"iso":"eng"}]}