{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:13:57Z","timestamp":1779174837451,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,10,24]],"date-time":"2011-10-24T00:00:00Z","timestamp":1319414400000},"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":[[2011,10,24]]},"DOI":"10.1145\/2063576.2063834","type":"proceedings-article","created":{"date-parts":[[2011,11,16]],"date-time":"2011-11-16T10:40:21Z","timestamp":1321440021000},"page":"1785-1794","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":57,"title":["Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs"],"prefix":"10.1145","author":[{"given":"Konstantin","family":"Tretyakov","sequence":"first","affiliation":[{"name":"University of Tartu, Tartu, Estonia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abel","family":"Armas-Cervantes","sequence":"additional","affiliation":[{"name":"University of Tartu, Tartu, Estonia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luciano","family":"Garc\u00eda-Ba\u00f1uelos","sequence":"additional","affiliation":[{"name":"University of Tartu, Tartu, Estonia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaak","family":"Vilo","sequence":"additional","affiliation":[{"name":"University of Tartu, Tartu, Estonia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marlon","family":"Dumas","sequence":"additional","affiliation":[{"name":"University of Tartu, Tartu, Estonia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,10,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1777879.1777889"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"U. Brandes. A faster algorithm for betweenness centrality 2001.  U. Brandes. A faster algorithm for betweenness centrality 2001.","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.198"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.08.001"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718537"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"D. Frigioni. Fully dynamic algorithms for maintaining shortest path trees 2000.  D. Frigioni. Fully dynamic algorithms for maintaining shortest path trees 2000.","DOI":"10.1006\/jagm.1999.1048"},{"key":"e_1_3_2_1_7_1","first-page":"156","volume-title":"Proc. 16th ACM-SIAM Symposium on Discrete Algorithms","author":"Goldberg A. V.","year":"2005"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"A. V. Goldberg H. Kaplan and R. F. Werneck. Abstract reach for A*: Efficient point-to-point shortest path algorithms 2006.  A. V. Goldberg H. Kaplan and R. F. Werneck. Abstract reach for A*: Efficient point-to-point shortest path algorithms 2006.","DOI":"10.1137\/1.9781611972863.13"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871503"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/VNIS.1994.396824"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.70"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_2_1_13_1","first-page":"5","article-title":"Maintaining an online bibliographical database: the problem of data quality. in egc, ser. revue des nouvelles technologies de l'information, vol. rnti-e-6","volume":"2006","author":"Ley M.","year":"2006","journal-title":"C\u00e9padu\u00e9s \u00c9ditions"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_3_2_1_15_1","volume-title":"D. Meltzer","author":"Pohl I.","year":"1971"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646063"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380798"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321440.1321520"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_3_2_1_20_1","first-page":"9","volume-title":"Proceedings of the 3rd conference on Online social networks, WOSN'10","author":"Zhao X.","year":"2010"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/647911.740642"}],"event":{"name":"CIKM '11: International Conference on Information and Knowledge Management","location":"Glasgow Scotland, UK","acronym":"CIKM '11","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 20th ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2063576.2063834","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2063576.2063834","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:54:36Z","timestamp":1750240476000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2063576.2063834"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,24]]},"references-count":21,"alternative-id":["10.1145\/2063576.2063834","10.1145\/2063576"],"URL":"https:\/\/doi.org\/10.1145\/2063576.2063834","relation":{},"subject":[],"published":{"date-parts":[[2011,10,24]]},"assertion":[{"value":"2011-10-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}