{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T22:56:35Z","timestamp":1730328995059,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2003,6,9]]},"DOI":"10.1145\/780542.780567","type":"proceedings-article","created":{"date-parts":[[2004,4,19]],"date-time":"2004-04-19T17:18:43Z","timestamp":1082395123000},"page":"159-166","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":40,"title":["A new approach to dynamic all pairs shortest paths"],"prefix":"10.1145","author":[{"given":"Camil","family":"Demetrescu","sequence":"first","affiliation":[{"name":"Universit\u00e0 di Roma \"Tor Vergata\", Rome, Italy"}]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[{"name":"Universit\u00e0 di Roma \"Tor Vergata\", Rome, Italy"}]}],"member":"320","published-online":{"date-parts":[[2003,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90036-X"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509928"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875575"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684440"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_6_1","first-page":"371","article-title":"Updating distances in dynamic graphs","volume":"49","author":"Even S.","year":"1985","unstructured":"S. Even and H. Gazit . Updating distances in dynamic graphs . Methods of Operations Research , 49 : 371 -- 387 , 1985 . S. Even and H. Gazit. Updating distances in dynamic graphs. Methods of Operations Research, 49:371--387, 1985.","journal-title":"Methods of Operations Research"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875577"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009224"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1048"},{"key":"e_1_3_2_1_11_1","volume-title":"Mathematics for the analysis of algorithms","author":"Greene D.","year":"1982","unstructured":"D. Greene and D. Knuth . Mathematics for the analysis of algorithms . Birkh\u00e4user , 1982 . D. Greene and D. Knuth. Mathematics for the analysis of algorithms. Birkh\u00e4user, 1982."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1493"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796487"},{"key":"e_1_3_2_1_14_1","first-page":"96","volume-title":"A network evaluation procedure. Highway Research Record 205","author":"Loubal P.","year":"1967","unstructured":"P. Loubal . A network evaluation procedure. Highway Research Record 205 , pages 96 -- 109 , 1967 . P. Loubal. A network evaluation procedure. Highway Research Record 205, pages 96--109, 1967."},{"key":"e_1_3_2_1_15_1","volume-title":"The effect of increasing or decreasing the length of a single arc on all shortest distances in a graph. Technical report","author":"Murchland J.","year":"1967","unstructured":"J. Murchland . The effect of increasing or decreasing the length of a single arc on all shortest distances in a graph. Technical report , LBS-TNT-26, London Business School, Transport Network Theory Unit, London, UK , 1967 . J. Murchland. The effect of increasing or decreasing the length of a single arc on all shortest distances in a graph. Technical report, LBS-TNT-26, London Business School, Transport Network Theory Unit, London, UK, 1967."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0046"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00079-8"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(68)90148-1"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/646502.696131"}],"event":{"name":"STOC03: The 35th Annual ACM Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"San Diego CA USA","acronym":"STOC03"},"container-title":["Proceedings of the thirty-fifth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/780542.780567","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T05:33:14Z","timestamp":1672983194000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/780542.780567"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6,9]]},"references-count":19,"alternative-id":["10.1145\/780542.780567","10.1145\/780542"],"URL":"https:\/\/doi.org\/10.1145\/780542.780567","relation":{},"subject":[],"published":{"date-parts":[[2003,6,9]]},"assertion":[{"value":"2003-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}