{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T08:13:06Z","timestamp":1790755986289,"version":"4.1.0"},"reference-count":21,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,11]]},"abstract":"<jats:p>Data structures are presented for the problem of maintaining a minimum spanning tree on-line under the operation of updating the cost of some edge in the graph. For the case of a general graph, maintaining the data structure and updating the tree are shown to take $O(\\sqrt m )$ time, where m is the number of edges in the graph. For the case of a planar graph, a data structure is presented which supports an update time of $O((\\log m)^2 )$. These structures contribute to improved solutions for the on-line connected components problem and the problem of generating the K smallest spanning trees.<\/jats:p>","DOI":"10.1137\/0214055","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"781-798","source":"Crossref","is-referenced-by-count":251,"title":["Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications"],"prefix":"10.1137","volume":"14","author":[{"given":"Greg N.","family":"Frederickson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"RAHU","volume-title":"The design and analysis of computer algorithms","author":"Aho Alfred V.","year":"1975"},{"key":"RCT","doi-asserted-by":"publisher","DOI":"10.1137\/0205051"},{"key":"RCH","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90022-3"},{"key":"RES","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322235"},{"key":"RF","doi-asserted-by":"crossref","unstructured":"G. N. Frederickson,  Data structures for on-line updating of minimum spanning trees,  Proc. 15th ACM Symposium on Theory of Computing, Boston,  1983,  252\u2013257, April","DOI":"10.1145\/800061.808754"},{"key":"RFS1","unstructured":"G. N. Frederickson, M. A. Srinivas,  On-line updating of degree-constrained minimum spanning trees,  1984, Proc. 22nd Allerton Conference on Communication, Control, and Computing, October, to appear"},{"key":"RFS2","doi-asserted-by":"crossref","unstructured":"G. N. Frederickson, M. A. Srinivas,  Data structures for on-line updating of matroid intersection solutions,  Proc. 16th ACM Symposium on Theory of Computing, Washington, DC,  1984,  383\u2013390, April","DOI":"10.1145\/800057.808704"},{"key":"RG","doi-asserted-by":"publisher","DOI":"10.1137\/0206011"},{"key":"RHL1","unstructured":"Dov Harel,  On line maintenance of the connected components of dynamic graphs,  1982, manuscript"},{"key":"RHL2","unstructured":"Dov Harel,  1983, personal communication"},{"key":"RHY","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"key":"RKIM","doi-asserted-by":"publisher","DOI":"10.1137\/0210017"},{"key":"RL","volume-title":"Combinatorial optimization: networks and matroids","author":"Lawler Eugene L.","year":"1976"},{"key":"ROV","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90012-X"},{"key":"RST","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90006-5"},{"key":"RSP","doi-asserted-by":"publisher","DOI":"10.1137\/0204032"},{"key":"RTI","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321884"},{"key":"RT2","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322161"},{"key":"RW","volume-title":"Matroid theory","author":"Welsh D. J. A.","year":"1976"},{"key":"RWL","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3839"},{"key":"RY","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(75)90056-3"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:39:49Z","timestamp":1787337589000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,11]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,11]]}},"alternative-id":["10.1137\/0214055"],"URL":"https:\/\/doi.org\/10.1137\/0214055","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,11]]}}}