{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T13:38:00Z","timestamp":1772372280578,"version":"3.50.1"},"reference-count":34,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1016\/0196-6774(92)90004-v","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"33-54","source":"Crossref","is-referenced-by-count":73,"title":["Maintenance of a minimum spanning forest in a dynamic plane graph"],"prefix":"10.1016","volume":"13","author":[{"given":"David","family":"Eppstein","sequence":"first","affiliation":[]},{"given":"Giuseppe F","family":"Italiano","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[]},{"given":"Robert E","family":"Tarjan","sequence":"additional","affiliation":[]},{"given":"Jeffery","family":"Westbrook","sequence":"additional","affiliation":[]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(92)90004-V_BIB1","series-title":"Proceedings, 1st ACM-SIAM Symp. on Discrete Algorithms","first-page":"12","article-title":"Incremental algorithms for minimal length paths","author":"Ausiello","year":"1990"},{"key":"10.1016\/0196-6774(92)90004-V_BIB2","series-title":"Proceedings 30th IEEE Symp. on Foundations of Computer Science","first-page":"436","article-title":"Incremental planarity testing","author":"Battista","year":"1989"},{"key":"10.1016\/0196-6774(92)90004-V_BIB3","article-title":"On-line Planarity Testing","author":"Battista","year":"1989"},{"key":"10.1016\/0196-6774(92)90004-V_BIB4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(92)90004-V_BIB5","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1137\/0205051","article-title":"Finding minimum spanning trees","volume":"5","author":"Cheriton","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(92)90004-V_BIB6","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/0022-0000(85)90004-2","article-title":"A linear algorithm for embedding planar graphs using PQ-trees","volume":"30","author":"Chiba","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(92)90004-V_BIB7","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0022-0000(78)90022-3","article-title":"Algorithms for updating minimum spanning trees","volume":"16","author":"Chin","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(92)90004-V_BIB8","first-page":"371","article-title":"Updating distances in dynamic graphs","volume":"49","author":"Even","year":"1985","journal-title":"Methods Oper. Res."},{"key":"10.1016\/0196-6774(92)90004-V_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322234.322235","article-title":"An on-line edge deletion problem","volume":"28","author":"Even","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(92)90004-V_BIB10","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1137\/0214055","article-title":"Data structures for on-line updating of minimum spanning trees, with applications","volume":"14","author":"Frederickson","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(92)90004-V_BIB11","first-page":"210","article-title":"Efficient algorithms for graphic matroid intersection and parity (extended abstract)","volume":"Vol. 194","author":"Gabow","year":"1985"},{"key":"10.1016\/0196-6774(92)90004-V_BIB12","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01594940","article-title":"Use of dynamic trees in a network simplex algorithm for the maximum flow problem","volume":"50","author":"Goldberg","year":"1991","journal-title":"Math. Programming"},{"key":"10.1016\/0196-6774(92)90004-V_BIB13","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/282918.282923","article-title":"Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams","volume":"4","author":"Guibas","year":"1985","journal-title":"ACM Trans. Graphics"},{"key":"10.1016\/0196-6774(92)90004-V_BIB14","series-title":"Graph Theory","author":"Harary","year":"1972"},{"key":"10.1016\/0196-6774(92)90004-V_BIB15","series-title":"On-line maintenance of the connected components of dynamic graphs","author":"Harel","year":"1982"},{"key":"10.1016\/0196-6774(92)90004-V_BIB16","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","article-title":"Efficient planarity testing","volume":"21","author":"Hopcroft","year":"1974","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(92)90004-V_BIB17","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0190(83)90033-9","article-title":"On-line computation of transitive closure for graphs","volume":"16","author":"Ibaraki","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(92)90004-V_BIB18","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0304-3975(86)90098-8","article-title":"Amortized efficiency of a path retrieval data structure","volume":"48","author":"Italiano","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0196-6774(92)90004-V_BIB19","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0020-0190(88)90136-6","article-title":"Finding paths and deleting edges in directed acyclic graphs","volume":"28","author":"Italiano","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(92)90004-V_BIB20","series-title":"Proc. Workshop on Algorithms and Data Structures (WADS 89)","first-page":"352","article-title":"Dynamic data structures for series parallel digraphs","volume":"vol. 382","author":"Italiano","year":"1989"},{"key":"10.1016\/0196-6774(92)90004-V_BIB21","series-title":"Proceedings, International Workshop on Graph-Theoretic Concepts in Computer Science (WG 87)","first-page":"106","article-title":"Maintenance of transitive closure and transitive reduction of graphs","volume":"Vol. 314","author":"La Poutr\u00e9","year":"1988"},{"key":"10.1016\/0196-6774(92)90004-V_BIB22","series-title":"Symposium uber Logik und Algolrithmik","article-title":"Decision trees and random access machines","author":"Paul","year":"1980"},{"key":"10.1016\/0196-6774(92)90004-V_BIB23","series-title":"Proceedings, 29th IEEE Symp. on foundations of Computer Science","first-page":"558","article-title":"Fully dynamic techniques for point location and transitive closure in planar structures","author":"Preparata","year":"1988"},{"key":"10.1016\/0196-6774(92)90004-V_BIB24","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0020-0190(87)90095-0","article-title":"A topological approach to dynamic graph connectivity","volume":"25","author":"Reif","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(92)90004-V_BIB25","series-title":"Proceedings, 2nd Annual Symp. on Theoretical Aspects of Computer Science (STACS 85)","first-page":"279","article-title":"A dynamization of the all pairs least cost path problem","volume":"Vol. 182","author":"Rohnert","year":"1985"},{"key":"10.1016\/0196-6774(92)90004-V_BIB26","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","article-title":"A data structure for dynamic trees","volume":"26","author":"Sleator","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(92)90004-V_BIB27","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1145\/3828.3835","article-title":"Self-adjusting binary search trees","volume":"32","author":"Sleator","year":"1985","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(92)90004-V_BIB28","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1137\/0204032","article-title":"On finding and updating spanning trees and shortest paths","volume":"4","author":"Spira","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(92)90004-V_BIB29","series-title":"Proceedings, 15th Int. Conf. on Automata, Languages, and Programming (ICALP 1988)","first-page":"576","article-title":"A dynamic data structure for planar graph embedding","volume":"Vol. 317","author":"Tamassia","year":"1988"},{"key":"10.1016\/0196-6774(92)90004-V_BIB30","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/0020-0190(82)90137-5","article-title":"Sensitivity analysis of minimum spanning trees and shortest path trees","volume":"14","author":"Tarjan","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(92)90004-V_BIB31","series-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"},{"key":"10.1016\/0196-6774(92)90004-V_BIB32","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","article-title":"Amortized computational complexity","volume":"6","author":"Tarjan","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0196-6774(92)90004-V_BIB33","series-title":"Graph Theory","author":"Tutte","year":"1984"},{"key":"10.1016\/0196-6774(92)90004-V_BIB34","series-title":"Technical report","article-title":"A Dynamic Transitive Closure Algorithm","author":"Yellin","year":"1988"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749290004V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749290004V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:53:32Z","timestamp":1548744812000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667749290004V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["019667749290004V"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(92)90004-v","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}