{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T00:32:56Z","timestamp":1794357176351,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":19,"publisher":"Springer US","isbn-type":[{"value":"9780387307701","type":"print"},{"value":"9780387301624","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_102","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T14:36:18Z","timestamp":1214490978000},"page":"226-227","source":"Crossref","is-referenced-by-count":1,"title":["Decremental All-Pairs Shortest Paths"],"prefix":"10.1007","author":[{"given":"Camil","family":"Demetrescu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"102_CR1_102","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs, NJ (1993)"},{"key":"102_CR2_102","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1145\/1039488.1039492","volume":"51","author":"C. Demetrescu","year":"2004","unstructured":"Demetrescu, C., Italiano, G.: A\u00a0new approach to dynamic all pairs shortest paths. J.\u00a0Assoc. Comp. Mach. 51, 968\u2013992 (2004)","journal-title":"J. Assoc. Comp. Mach."},{"key":"102_CR3_102","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. Dijkstra","year":"1959","unstructured":"Dijkstra, E.: A\u00a0note on two problems in connexion with graphs. Numerische Mathematik 1, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"102_CR4_102","first-page":"371","volume":"49","author":"S. Even","year":"1985","unstructured":"Even, S., Gazit, H.: Updating distances in dynamic graphs. Meth. Op. Res. 49, 371\u2013387 (1985)","journal-title":"Meth. Op. Res."},{"key":"102_CR5_102","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. Fredman","year":"1987","unstructured":"Fredman, M., Tarjan, R.: Fibonacci heaps and their use in improved network optimization algorithms. J.\u00a0ACM 34, 596\u2013615 (1987)","journal-title":"J. ACM"},{"issue":"1","key":"102_CR6_102","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1137\/0205006","volume":"5","author":"M.L. Fredman","year":"1976","unstructured":"Fredman, M.L.: New bounds on the complexity of the shortest path problems. SIAM J.\u00a0Comp. 5(1), 87\u201389 (1976)","journal-title":"SIAM J. Comp."},{"key":"102_CR7_102","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/PL00009224","volume":"22","author":"D. Frigioni","year":"1998","unstructured":"Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Semi\u2010dynamic algorithms for maintaining single source shortest paths trees. Algorithmica 22, 250\u2013274 (1998)","journal-title":"Algorithmica"},{"key":"102_CR8_102","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1006\/jagm.1999.1048","volume":"34","author":"D. Frigioni","year":"2000","unstructured":"Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Fully dynamic algorithms for maintaining shortest paths trees. J.\u00a0Algorithm 34, 351\u2013381 (2000)","journal-title":"J. Algorithm"},{"key":"102_CR9_102","first-page":"81","volume-title":"Proc. 40th IEEE Symposium on Foundations of Computer Science (FOCS'99)","author":"V. King","year":"1999","unstructured":"King, V.: Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In: Proc. 40th IEEE Symposium on Foundations of Computer Science (FOCS'99), pp. 81\u201399. IEEE Computer Society, New York, USA (1999)"},{"key":"102_CR10_102","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1002\/spe.4380111102","volume":"11","author":"D. Knuth","year":"1981","unstructured":"Knuth, D., Plass, M.: Breaking paragraphs into lines. Software-Practice Exp. 11, 1119\u20131184 (1981)","journal-title":"Software-Practice Exp."},{"key":"102_CR11_102","first-page":"96","volume":"205","author":"P. Loubal","year":"1967","unstructured":"Loubal, P.: A\u00a0network evaluation procedure. Highway Res. Rec. 205, 96\u2013109 (1967)","journal-title":"Highway Res. Rec."},{"key":"102_CR12_102","volume-title":"The effect of increasing or decreasing the length of a single arc on all shortest distances in a graph, tech. rep., LBS-TNT-26, London Business School","author":"J. Murchland","year":"1967","unstructured":"Murchland, J.: The effect of increasing or decreasing the length of a\u00a0single arc on all shortest distances in a\u00a0graph, tech. rep., LBS-TNT-26, London Business School. Transport Network Theory Unit, London, UK (1967)"},{"key":"102_CR13_102","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(03)00402-X","volume":"312","author":"S. Pettie","year":"2003","unstructured":"Pettie, S.: A\u00a0new approach to all-pairs shortest paths on real-weighted graphs. Theor. Comp. Sci. 312, 47\u201374 (2003) special issue of selected papers from ICALP (2002)","journal-title":"Theor. Comp. Sci."},{"key":"102_CR14_102","doi-asserted-by":"crossref","unstructured":"Ramalingam, G.: Bounded incremental computation. Lect. Note Comp. Sci. 1089 (1996)","DOI":"10.1007\/BFb0028290"},{"key":"102_CR15_102","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jagm.1996.0046","volume":"21","author":"G. Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.: An incremental algorithm for a\u00a0generalization of the shortest path problem. J.\u00a0Algorithm 21, 267\u2013305 (1996)","journal-title":"J. Algorithm"},{"key":"102_CR16_102","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. Theor. Comp. Sci. 158, 233\u2013277 (1996)","journal-title":"Theor. Comp. Sci."},{"key":"102_CR17_102","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/0041-5553(68)90148-1","volume":"8","author":"V. Rodionov","year":"1968","unstructured":"Rodionov, V.: The parametric problem of shortest distances. USSR Comp. Math. Math. Phys. 8, 336\u2013343 (1968)","journal-title":"USSR Comp. Math. Math. Phys."},{"key":"102_CR18_102","doi-asserted-by":"crossref","unstructured":"Schulz, F., Wagner, D., Weihe, K.: Dijkstra's algorithm on-line: an empirical case study from public railroad transport. In: Proc. 3rd Workshop on Algorithm Engineering (WAE'99), pp. 110\u2013123. Notes in Computer Science 1668. London, UK (1999)","DOI":"10.1007\/3-540-48318-7_11"},{"key":"102_CR19_102","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0020-0190(92)90200-F","volume":"43","author":"T. Takaoka","year":"1992","unstructured":"Takaoka, T.: A\u00a0new upper bound on the complexity of the all pairs shortest path problem. Inf. Proc. Lett. 43, 195\u2013199 (1992)","journal-title":"Inf. Proc. Lett."}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,2]],"date-time":"2022-09-02T22:12:23Z","timestamp":1662156743000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_102"}},"subtitle":["2004; Demetrescu, Italiano"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_102","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008]]}}}