{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T04:37:15Z","timestamp":1761971835048,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642322808"},{"type":"electronic","value":"9783642322815"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32281-5_29","type":"book-chapter","created":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T12:59:36Z","timestamp":1344862776000},"page":"296-307","source":"Crossref","is-referenced-by-count":4,"title":["Dynamic Graph Shortest Path Algorithm"],"prefix":"10.1007","author":[{"given":"Xueli","family":"Liu","sequence":"first","affiliation":[]},{"given":"Hongzhi","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/a2010001","volume":"2","author":"R. Bauer","year":"2009","unstructured":"Bauer, R., Wagner, D.: Batch dynamic single-source shortest-path algorithms: An experimental study. Experimental Algorithms\u00a02, 1\u201320 (2009)","journal-title":"Experimental Algorithms"},{"issue":"1-2","key":"29_CR2","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0304-3975(95)00079-8","volume":"158","author":"G. Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.: On the computational complexity of dynamic graph problems. Theoretical Computer Science\u00a0158(1-2), 233\u2013277 (1996)","journal-title":"Theoretical Computer Science"},{"key":"29_CR3","unstructured":"Even, S., Gazit, H.: Updating distances in dynamic graphs. J. Algorithms (1985)"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BFb0024016","volume-title":"STACS 85","author":"H. Rohnert","year":"1984","unstructured":"Rohnert, H.: A dynamization of the all-pairs least cost problem. In: Mehlhorn, K. (ed.) STACS 1985. LNCS, vol.\u00a0182, pp. 279\u2013286. Springer, Heidelberg (1984)"},{"key":"29_CR5","unstructured":"Ramalingam, G.: An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms (1991)"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Franciosa, P.G., Frigioni, D., Giaccio, R., Sapienza, L.: Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs. Search\u00a02(20244) (1997)","DOI":"10.1007\/BFb0023446"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Frigioni, D., Marchetti-spaccamela, A., Nanni, U.: Fully Dynamic Algorithms for Maintaining Shortest Paths Trees 1. Journal of Algorithms\u00a0(201), 251\u2013281 (2000)","DOI":"10.1006\/jagm.1999.1048"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Ausiello, G., Italiano, G.F.: Incremental algorithms for minimal length paths. J. Algorithms (1991)","DOI":"10.1016\/0196-6774(91)90036-X"},{"key":"29_CR9","unstructured":"Henzinger, M.R.: Faster Shortest-Path Algorithms for Planar Graphs 23, 3\u201323 (1997)"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Fakcharoenphol, J., Rao, S.: Planar graphs, negative weight edges, shortest paths, and near linear time. Foundations (2002)","DOI":"10.1109\/SFCS.2001.959897"},{"key":"29_CR11","unstructured":"Chan, E.P.F., Yang, Y.: Shortest Path Trees Computation in Dynamic Graphs. Most, 1\u201345"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32281-5_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:59:40Z","timestamp":1620129580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32281-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642322808","9783642322815"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32281-5_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}