{"status":"public","abstract":[{"text":"We present the first fully dynamic algorithm for maintaining a minimum spanning tree in time o(√n) per operation. To be precise, the algorithm uses O(n 1/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(n 1/3 log n) per update, with O(1) worst case time per query.","lang":"eng"}],"publisher":"Springer Nature","extern":"1","type":"conference","date_created":"2022-08-11T13:35:06Z","publication":"24th International Colloquium on Automata, Languages and Programming","doi":"10.1007/3-540-63165-8_214","conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","location":"Bologna, Italy","end_date":"1997-07-11","start_date":"1997-07-07"},"oa_version":"None","volume":1256,"quality_controlled":"1","article_processing_charge":"No","publication_identifier":{"eisbn":["9783540691945"],"issn":["0302-9743"],"isbn":["9783540631651"],"eissn":["1611-3349"]},"author":[{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"last_name":"King","first_name":"Valerie","full_name":"King, Valerie"}],"scopus_import":"1","month":"07","language":[{"iso":"eng"}],"page":"594–604","date_updated":"2023-02-14T07:49:03Z","intvolume":"      1256","title":"Maintaining minimum spanning trees in dynamic graphs","year":"1997","day":"01","date_published":"1997-07-01T00:00:00Z","citation":{"ista":"Henzinger MH, King V. 1997. Maintaining minimum spanning trees in dynamic graphs. 24th International Colloquium on Automata, Languages and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 1256, 594–604.","ama":"Henzinger MH, King V. Maintaining minimum spanning trees in dynamic graphs. In: <i>24th International Colloquium on Automata, Languages and Programming</i>. Vol 1256. Springer Nature; 1997:594–604. doi:<a href=\"https://doi.org/10.1007/3-540-63165-8_214\">10.1007/3-540-63165-8_214</a>","apa":"Henzinger, M. H., &#38; King, V. (1997). Maintaining minimum spanning trees in dynamic graphs. In <i>24th International Colloquium on Automata, Languages and Programming</i> (Vol. 1256, pp. 594–604). Bologna, Italy: Springer Nature. <a href=\"https://doi.org/10.1007/3-540-63165-8_214\">https://doi.org/10.1007/3-540-63165-8_214</a>","mla":"Henzinger, Monika H., and Valerie King. “Maintaining Minimum Spanning Trees in Dynamic Graphs.” <i>24th International Colloquium on Automata, Languages and Programming</i>, vol. 1256, Springer Nature, 1997, pp. 594–604, doi:<a href=\"https://doi.org/10.1007/3-540-63165-8_214\">10.1007/3-540-63165-8_214</a>.","chicago":"Henzinger, Monika H, and Valerie King. “Maintaining Minimum Spanning Trees in Dynamic Graphs.” In <i>24th International Colloquium on Automata, Languages and Programming</i>, 1256:594–604. Springer Nature, 1997. <a href=\"https://doi.org/10.1007/3-540-63165-8_214\">https://doi.org/10.1007/3-540-63165-8_214</a>.","short":"M.H. Henzinger, V. King, in:, 24th International Colloquium on Automata, Languages and Programming, Springer Nature, 1997, pp. 594–604.","ieee":"M. H. Henzinger and V. King, “Maintaining minimum spanning trees in dynamic graphs,” in <i>24th International Colloquium on Automata, Languages and Programming</i>, Bologna, Italy, 1997, vol. 1256, pp. 594–604."},"publication_status":"published","alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11803"}