{"oa_version":"None","abstract":[{"lang":"eng","text":"We present the first fully dynamic algorithm for maintaining a minimum spanning forest in time 𝑜(𝑛√) per operation. To be precise, the algorithm uses O(n1/3 log n) amortized time per update operation. The algorithm is fairly simple and deterministic. An immediate consequence is the first fully dynamic deterministic algorithm for maintaining connectivity and bipartiteness in amortized time O(n1/3 log n) per update, with O(1) worst case time per query."}],"publication":"SIAM Journal on Computing","issue":"2","publication_status":"published","quality_controlled":"1","scopus_import":"1","title":"Maintaining minimum spanning forests in dynamic graphs","_id":"11892","doi":"10.1137/s0097539797327209","author":[{"last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","first_name":"Monika H","orcid":"0000-0002-5008-6530"},{"last_name":"King","full_name":"King, Valerie","first_name":"Valerie"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"intvolume":"        31","extern":"1","type":"journal_article","date_updated":"2023-02-17T14:24:55Z","volume":31,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2001-03-01T00:00:00Z","day":"01","publisher":"Society for Industrial & Applied Mathematics","status":"public","year":"2001","article_type":"original","page":"364-374","month":"03","date_created":"2022-08-17T08:43:43Z","citation":{"ista":"Henzinger MH, King V. 2001. Maintaining minimum spanning forests in dynamic graphs. SIAM Journal on Computing. 31(2), 364–374.","chicago":"Henzinger, Monika H, and Valerie King. “Maintaining Minimum Spanning Forests in Dynamic Graphs.” <i>SIAM Journal on Computing</i>. Society for Industrial &#38; Applied Mathematics, 2001. <a href=\"https://doi.org/10.1137/s0097539797327209\">https://doi.org/10.1137/s0097539797327209</a>.","apa":"Henzinger, M. H., &#38; King, V. (2001). Maintaining minimum spanning forests in dynamic graphs. <i>SIAM Journal on Computing</i>. Society for Industrial &#38; Applied Mathematics. <a href=\"https://doi.org/10.1137/s0097539797327209\">https://doi.org/10.1137/s0097539797327209</a>","short":"M.H. Henzinger, V. King, SIAM Journal on Computing 31 (2001) 364–374.","ama":"Henzinger MH, King V. Maintaining minimum spanning forests in dynamic graphs. <i>SIAM Journal on Computing</i>. 2001;31(2):364-374. doi:<a href=\"https://doi.org/10.1137/s0097539797327209\">10.1137/s0097539797327209</a>","mla":"Henzinger, Monika H., and Valerie King. “Maintaining Minimum Spanning Forests in Dynamic Graphs.” <i>SIAM Journal on Computing</i>, vol. 31, no. 2, Society for Industrial &#38; Applied Mathematics, 2001, pp. 364–74, doi:<a href=\"https://doi.org/10.1137/s0097539797327209\">10.1137/s0097539797327209</a>.","ieee":"M. H. Henzinger and V. King, “Maintaining minimum spanning forests in dynamic graphs,” <i>SIAM Journal on Computing</i>, vol. 31, no. 2. Society for Industrial &#38; Applied Mathematics, pp. 364–374, 2001."},"article_processing_charge":"No"}