{"title":"Improved data structures for fully dynamic biconnectivity","month":"11","issue":"6","_id":"11893","publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"doi":"10.1137/s0097539794263907","citation":{"short":"M.H. Henzinger, SIAM Journal on Computing 29 (2000) 1761–1815.","apa":"Henzinger, M. H. (2000). Improved data structures for fully dynamic biconnectivity. <i>SIAM Journal on Computing</i>. Society for Industrial &#38; Applied Mathematics. <a href=\"https://doi.org/10.1137/s0097539794263907\">https://doi.org/10.1137/s0097539794263907</a>","ama":"Henzinger MH. Improved data structures for fully dynamic biconnectivity. <i>SIAM Journal on Computing</i>. 2000;29(6):1761-1815. doi:<a href=\"https://doi.org/10.1137/s0097539794263907\">10.1137/s0097539794263907</a>","ista":"Henzinger MH. 2000. Improved data structures for fully dynamic biconnectivity. SIAM Journal on Computing. 29(6), 1761–1815.","ieee":"M. H. Henzinger, “Improved data structures for fully dynamic biconnectivity,” <i>SIAM Journal on Computing</i>, vol. 29, no. 6. Society for Industrial &#38; Applied Mathematics, pp. 1761–1815, 2000.","mla":"Henzinger, Monika H. “Improved Data Structures for Fully Dynamic Biconnectivity.” <i>SIAM Journal on Computing</i>, vol. 29, no. 6, Society for Industrial &#38; Applied Mathematics, 2000, pp. 1761–815, doi:<a href=\"https://doi.org/10.1137/s0097539794263907\">10.1137/s0097539794263907</a>.","chicago":"Henzinger, Monika H. “Improved Data Structures for Fully Dynamic Biconnectivity.” <i>SIAM Journal on Computing</i>. Society for Industrial &#38; Applied Mathematics, 2000. <a href=\"https://doi.org/10.1137/s0097539794263907\">https://doi.org/10.1137/s0097539794263907</a>."},"type":"journal_article","oa_version":"None","article_type":"original","publisher":"Society for Industrial & Applied Mathematics","scopus_import":"1","publication_status":"published","volume":29,"author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"}],"extern":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"1761-1815","status":"public","date_created":"2022-08-17T08:45:41Z","abstract":[{"text":"We present fully dynamic algorithms for maintaining the biconnected components in general and plane graphs.\r\n\r\nA 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 best deterministic algorithms is 𝑂(𝑛√) in general graphs and O(log n) in plane graphs for fully dynamic connectivity and O(min m2/3 ,n}) in general graphs and 𝑂(𝑛√) in plane graphs for fully dynamic biconnectivity. We improve the later running times to 𝑂(𝑚log𝑛‾‾‾‾‾‾‾√) in general graphs and O(log 2n ) in plane graphs. Our algorithm for general graphscan also find the biconnected components of all vertices in time O(n).","lang":"eng"}],"publication":"SIAM Journal on Computing","intvolume":"        29","date_updated":"2023-02-17T14:39:47Z","quality_controlled":"1","article_processing_charge":"No","date_published":"2000-11-01T00:00:00Z","year":"2000","day":"01"}