{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:23:24Z","timestamp":1765887804484,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,18]],"date-time":"2016-07-18T00:00:00Z","timestamp":1468800000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,18]]},"DOI":"10.1145\/2949689.2949713","type":"proceedings-article","created":{"date-parts":[[2016,7,8]],"date-time":"2016-07-08T15:03:00Z","timestamp":1467990180000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Efficient Maintenance of All-Pairs Shortest Distances"],"prefix":"10.1145","author":[{"given":"Sergio","family":"Greco","sequence":"first","affiliation":[{"name":"DIMES, University of Calabria, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristian","family":"Molinaro","sequence":"additional","affiliation":[{"name":"DIMES, University of Calabria, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chiara","family":"Pulice","sequence":"additional","affiliation":[{"name":"DIMES, University of Calabria, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"The DIMES project. http:\/\/www.netdimes.org\/new\/.  The DIMES project. http:\/\/www.netdimes.org\/new\/."},{"volume-title":"http:\/\/neo4j.com","year":"2016","key":"e_1_3_2_1_2_1","unstructured":"Neo4j , http:\/\/neo4j.com , 2016 . Neo4j, http:\/\/neo4j.com, 2016."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_3_2_1_4_1","first-page":"394","volume-title":"SODA","author":"Baswana S.","year":"2003","unstructured":"S. Baswana , R. Hariharan , and S. Sen . Maintaining all-pairs approximate shortest paths under deletion of edges . In SODA , pages 394 -- 403 , 2003 . S. Baswana, R. Hariharan, and S. Sen. Maintaining all-pairs approximate shortest paths under deletion of edges. In SODA, pages 394--403, 2003."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.08.004"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488701"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02279-1_29"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/08071990X"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2344422.2344424"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0274-x"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213888"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396881"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2011.06.001"},{"key":"e_1_3_2_1_14_1","first-page":"369","volume-title":"SODA","author":"Demetrescu C.","year":"2004","unstructured":"C. Demetrescu , S. Emiliozzi , and G. F. Italiano . Experimental analysis of dynamic all pairs shortest path algorithms . In SODA , pages 369 -- 378 , 2004 . C. Demetrescu, S. Emiliozzi, and G. F. Italiano. Experimental analysis of dynamic all pairs shortest path algorithms. In SODA, pages 369--378, 2004."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039492"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920878"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536346"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.43"},{"key":"e_1_3_2_1_20_1","first-page":"26","volume-title":"ALENEX\/ANALCO","author":"Goldberg A. V.","year":"2005","unstructured":"A. V. Goldberg and R. F. F. Werneck . Computing point-to-point shortest paths from external memory . In ALENEX\/ANALCO , pages 26 -- 40 , 2005 . A. V. Goldberg and R. F. F. Werneck. Computing point-to-point shortest paths from external memory. In ALENEX\/ANALCO, pages 26--40, 2005."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871503"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170066"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.64"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332504"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90136-6"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213887"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-014-0220-6"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796487"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535331_16"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1839379.1839381"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1093382.1093384"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646063"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btg415"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732219.2732225"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.53"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti116"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"G.\n      Ramalingam\n    . \n      Bounded Incremental\n      Computation volume \n  1089\n   of \n  Lecture Notes in Computer Science\n  . \n  Springer 1996\n  .   G. Ramalingam. Bounded Incremental Computation volume 1089 of Lecture Notes in Computer Science. Springer 1996.","DOI":"10.1007\/BFb0028290"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/090776573"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718537"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1078"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2530531"},{"key":"e_1_3_2_1_42_1","first-page":"278","volume-title":"COCOON","author":"Takaoka T.","year":"2004","unstructured":"T. Takaoka . A faster algorithm for the all-pairs shortest path problem and its application . In COCOON , pages 278 -- 289 , 2004 . T. Takaoka. A faster algorithm for the all-pairs shortest path problem and its application. In COCOON, pages 278--289, 2004."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140438"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465277"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487665"}],"event":{"name":"SSDBM '16: Conference on Scientific and Statistical Database Management","acronym":"SSDBM '16","location":"Budapest Hungary"},"container-title":["Proceedings of the 28th International Conference on Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2949689.2949713","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2949689.2949713","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:00Z","timestamp":1750222560000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2949689.2949713"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,18]]},"references-count":45,"alternative-id":["10.1145\/2949689.2949713","10.1145\/2949689"],"URL":"https:\/\/doi.org\/10.1145\/2949689.2949713","relation":{},"subject":[],"published":{"date-parts":[[2016,7,18]]},"assertion":[{"value":"2016-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}