{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:25:32Z","timestamp":1765887932347,"version":"3.37.3"},"reference-count":63,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2018,3,1]]},"DOI":"10.1109\/tkde.2017.2772233","type":"journal-article","created":{"date-parts":[[2017,11,10]],"date-time":"2017-11-10T19:20:42Z","timestamp":1510341642000},"page":"474-487","source":"Crossref","is-referenced-by-count":6,"title":["Efficient Maintenance of Shortest Distances in Dynamic Graphs"],"prefix":"10.1109","volume":"30","author":[{"given":"Sergio","family":"Greco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4103-1084","authenticated-orcid":false,"given":"Cristian","family":"Molinaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5449-9044","authenticated-orcid":false,"given":"Chiara","family":"Pulice","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.14778\/2732219.2732225"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871503"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213887"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0274-x"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2530531"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646063"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465277"},{"key":"ref35","first-page":"26","article-title":"Computing point-to-point shortest paths from external memory","author":"goldberg","year":"2005","journal-title":"Proc 7th Workshop Algorithm Eng Experiments 2nd Workshop Analytic Algorithmics Combinatorics"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718537"},{"year":"0","key":"ref60"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1402008"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-015-0276-y"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"ref28","first-page":"369","article-title":"Experimental analysis of dynamic all pairs shortest path algorithms","author":"demetrescu","year":"2004","journal-title":"Proc Symp Discrete Algorithms"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90136-6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-014-0220-6"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2949689.2949713"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396881"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/08071990X"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1093382.1093384"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1078"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2344422.2344424"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332504"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27798-9_31"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158710"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488701"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/11535331_16"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33090-2_4"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07959-2_22"},{"year":"0","key":"ref56"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02279-1_29"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33353-8_11"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/69.971191"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170066"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btg415"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028290"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.53"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1613\/jair.3509","article-title":"Computing all-pairs shortest paths by leveraging low treewidth","volume":"43","author":"planken","year":"2012","journal-title":"J Artif Intell Res"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1839379.1839381"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039492"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1198513.1198519"},{"key":"ref16","first-page":"394","article-title":"Maintaining all-pairs approximate shortest paths under deletion of edges","author":"baswana","year":"2003","journal-title":"Proc Symp Discrete Algorithms"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/090776573"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.64"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814580"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti116"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140438"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939770"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920878"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.06.008"},{"key":"ref7","first-page":"558","article-title":"Diffusion centrality in social networks","author":"kang","year":"2012","journal-title":"Proc Int Conf Adv Social Netw Anal Mining"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00079-8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2480759.2480762"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.08.004"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.43"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983731"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2568007"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487665"},{"key":"ref41","first-page":"547","article-title":"Distance oracles in edge-labeled graphs","author":"bonchi","year":"2014","journal-title":"Proc Int Conf Extending Database Technol"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536346"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213888"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8280528\/08103819.pdf?arnumber=8103819","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:26:23Z","timestamp":1642004783000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8103819\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,1]]},"references-count":63,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2017.2772233","relation":{},"ISSN":["1041-4347"],"issn-type":[{"type":"print","value":"1041-4347"}],"subject":[],"published":{"date-parts":[[2018,3,1]]}}}