{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:53:20Z","timestamp":1775638400256,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,10,24]],"date-time":"2016-10-24T00:00:00Z","timestamp":1477267200000},"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,10,24]]},"DOI":"10.1145\/2983323.2983731","type":"proceedings-article","created":{"date-parts":[[2016,10,26]],"date-time":"2016-10-26T13:20:08Z","timestamp":1477488008000},"page":"1533-1542","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Fully Dynamic Shortest-Path Distance Query Acceleration on Massive Networks"],"prefix":"10.1145","author":[{"given":"Takanori","family":"Hayashi","sequence":"first","affiliation":[{"name":"The University of Tokyo, Tokyo, Japan"}]},{"given":"Takuya","family":"Akiba","sequence":"additional","affiliation":[{"name":"Preferred Networks, Inc, Tokyo, Japan"}]},{"given":"Ken-ichi","family":"Kawarabayashi","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2016,10,24]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"konect network dataset - KONECT May 2015.  konect network dataset - KONECT May 2015."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487664"},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2568007"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247614"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963488"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_8_1","volume-title":"Axioms for centrality. Internet Mathematics, 10(3--4):222--262","author":"Boldi P.","year":"2014","unstructured":"P. Boldi and S. Vigna . Axioms for centrality. Internet Mathematics, 10(3--4):222--262 , 2014 . P. Boldi and S. Vigna. Axioms for centrality. Internet Mathematics, 10(3--4):222--262, 2014."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0274-x"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2512938.2512944"},{"key":"e_1_3_2_1_11_1","first-page":"937","volume-title":"SODA","author":"Cohen E.","year":"2002","unstructured":"E. Cohen , E. Halperin , H. Kaplan , and U. Zwick . Reachability and distance queries via 2-hop labels . In SODA , pages 937 -- 946 , 2002 . E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In SODA, pages 937--946, 2002."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44777-2_27"},{"key":"e_1_3_2_1_13_1","first-page":"3147","volume-title":"NIPS","author":"Du N.","year":"2013","unstructured":"N. Du , L. Song , M. Gomez-Rodriguez , and H. Zha . Scalable influence estimation in continuous-time diffusion networks . In NIPS , pages 3147 -- 3155 , 2013 . N. Du, L. Song, M. Gomez-Rodriguez, and H. Zha. Scalable influence estimation in continuous-time diffusion networks. In NIPS, pages 3147--3155, 2013."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1048"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536346"},{"key":"e_1_3_2_1_17_1","first-page":"156","volume-title":"SODA","author":"Goldberg A. V.","year":"2005","unstructured":"A. V. Goldberg and C. Harrelson . Computing the shortest path: A search meets graph theory . In SODA , pages 156 -- 165 , 2005 . A. V. Goldberg and C. Harrelson. Computing the shortest path: A search meets graph theory. In SODA, pages 156--165, 2005."},{"key":"e_1_3_2_1_18_1","first-page":"561","volume-title":"ICML","author":"Gomez-Rodriguez M.","year":"2011","unstructured":"M. Gomez-Rodriguez , D. Balduzzi , and B. Sch\u00f6lkopf . Uncovering the temporal dynamics of diffusion networks . In ICML , pages 561 -- 568 , 2011 . M. Gomez-Rodriguez, D. Balduzzi, and B. Sch\u00f6lkopf. Uncovering the temporal dynamics of diffusion networks. In ICML, pages 561--568, 2011."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871503"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488433"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556263"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732993"},{"key":"e_1_3_2_1_23_1","volume-title":"Hub-accelerator: Fast and exact shortest path computation in large social networks. CoRR, abs\/1305.0507","author":"Jin R.","year":"2013","unstructured":"R. Jin , N. Ruan , B. You , and H. Wang . Hub-accelerator: Fast and exact shortest path computation in large social networks. CoRR, abs\/1305.0507 , 2013 . R. Jin, N. Ruan, B. You, and H. Wang. Hub-accelerator: Fast and exact shortest path computation in large social networks. CoRR, abs\/1305.0507, 2013."},{"key":"e_1_3_2_1_24_1","unstructured":"J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection.  J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.v58:7"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505760"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646063"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732219.2732225"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.53"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289527"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063834"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453934"}],"event":{"name":"CIKM'16: ACM Conference on Information and Knowledge Management","location":"Indianapolis Indiana USA","acronym":"CIKM'16","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 25th ACM International on Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2983323.2983731","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2983323.2983731","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:39:54Z","timestamp":1750217994000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2983323.2983731"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,24]]},"references-count":32,"alternative-id":["10.1145\/2983323.2983731","10.1145\/2983323"],"URL":"https:\/\/doi.org\/10.1145\/2983323.2983731","relation":{},"subject":[],"published":{"date-parts":[[2016,10,24]]},"assertion":[{"value":"2016-10-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}