{"id":"https://openalex.org/W2140271346","doi":"https://doi.org/10.1145/2063576.2063834","title":"Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs","display_name":"Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs","publication_year":2011,"publication_date":"2011-10-24","ids":{"openalex":"https://openalex.org/W2140271346","doi":"https://doi.org/10.1145/2063576.2063834","mag":"2140271346"},"language":"en","primary_location":{"id":"doi:10.1145/2063576.2063834","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2063576.2063834","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th ACM international conference on Information and knowledge management","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012675764","display_name":"Konstantin Tretyakov","orcid":null},"institutions":[{"id":"https://openalex.org/I56085075","display_name":"University of Tartu","ror":"https://ror.org/03z77qz90","country_code":"EE","type":"education","lineage":["https://openalex.org/I56085075"]}],"countries":["EE"],"is_corresponding":true,"raw_author_name":"Konstantin Tretyakov","raw_affiliation_strings":["University of Tartu, Tartu, Estonia"],"affiliations":[{"raw_affiliation_string":"University of Tartu, Tartu, Estonia","institution_ids":["https://openalex.org/I56085075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050881323","display_name":"Abel Armas-Cervantes","orcid":"https://orcid.org/0000-0003-0628-2451"},"institutions":[{"id":"https://openalex.org/I56085075","display_name":"University of Tartu","ror":"https://ror.org/03z77qz90","country_code":"EE","type":"education","lineage":["https://openalex.org/I56085075"]}],"countries":["EE"],"is_corresponding":false,"raw_author_name":"Abel Armas-Cervantes","raw_affiliation_strings":["University of Tartu, Tartu, Estonia"],"affiliations":[{"raw_affiliation_string":"University of Tartu, Tartu, Estonia","institution_ids":["https://openalex.org/I56085075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069093733","display_name":"Luciano Garc\u00eda\u2010Ba\u00f1uelos","orcid":"https://orcid.org/0000-0001-9076-903X"},"institutions":[{"id":"https://openalex.org/I56085075","display_name":"University of Tartu","ror":"https://ror.org/03z77qz90","country_code":"EE","type":"education","lineage":["https://openalex.org/I56085075"]}],"countries":["EE"],"is_corresponding":false,"raw_author_name":"Luciano Garc\u00eda-Ba\u00f1uelos","raw_affiliation_strings":["University of Tartu, Tartu, Estonia"],"affiliations":[{"raw_affiliation_string":"University of Tartu, Tartu, Estonia","institution_ids":["https://openalex.org/I56085075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011429527","display_name":"Jaak Vilo","orcid":"https://orcid.org/0000-0001-5604-4107"},"institutions":[{"id":"https://openalex.org/I56085075","display_name":"University of Tartu","ror":"https://ror.org/03z77qz90","country_code":"EE","type":"education","lineage":["https://openalex.org/I56085075"]}],"countries":["EE"],"is_corresponding":false,"raw_author_name":"Jaak Vilo","raw_affiliation_strings":["University of Tartu, Tartu, Estonia"],"affiliations":[{"raw_affiliation_string":"University of Tartu, Tartu, Estonia","institution_ids":["https://openalex.org/I56085075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085212075","display_name":"Marlon Dumas","orcid":"https://orcid.org/0000-0002-9247-7476"},"institutions":[{"id":"https://openalex.org/I56085075","display_name":"University of Tartu","ror":"https://ror.org/03z77qz90","country_code":"EE","type":"education","lineage":["https://openalex.org/I56085075"]}],"countries":["EE"],"is_corresponding":false,"raw_author_name":"Marlon Dumas","raw_affiliation_strings":["University of Tartu, Tartu, Estonia"],"affiliations":[{"raw_affiliation_string":"University of Tartu, Tartu, Estonia","institution_ids":["https://openalex.org/I56085075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5012675764"],"corresponding_institution_ids":["https://openalex.org/I56085075"],"apc_list":null,"apc_paid":null,"fwci":5.5394,"has_fulltext":false,"cited_by_count":78,"citation_normalized_percentile":{"value":0.96571934,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1785","last_page":"1794"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/landmark","display_name":"Landmark","score":0.9387980699539185},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7674218416213989},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7614113092422485},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7446117401123047},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5349240303039551},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.4446832239627838},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4365317225456238},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.408980131149292},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3637009859085083},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3332290053367615}],"concepts":[{"id":"https://openalex.org/C2780297707","wikidata":"https://www.wikidata.org/wiki/Q4895393","display_name":"Landmark","level":2,"score":0.9387980699539185},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7674218416213989},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7614113092422485},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7446117401123047},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5349240303039551},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4446832239627838},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4365317225456238},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.408980131149292},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3637009859085083},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3332290053367615},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2063576.2063834","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2063576.2063834","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th ACM international conference on Information and knowledge management","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.650.188","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.650.188","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"http://kt.fouryears.eu/papers/Tretyakov2011b.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.412.3958","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.412.3958","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://math.ut.ee/~dumas/pubs/cikm2011.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320335322","display_name":"European Regional Development Fund","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1209362753","https://openalex.org/W1527104720","https://openalex.org/W2014889099","https://openalex.org/W2052703084","https://openalex.org/W2056403031","https://openalex.org/W2087989168","https://openalex.org/W2093455937","https://openalex.org/W2098636939","https://openalex.org/W2101196063","https://openalex.org/W2112090702","https://openalex.org/W2112964526","https://openalex.org/W2115022330","https://openalex.org/W2151021662","https://openalex.org/W2151400766","https://openalex.org/W2159394589","https://openalex.org/W2169140571","https://openalex.org/W2171707538","https://openalex.org/W2172107427","https://openalex.org/W2283762717","https://openalex.org/W2548579856"],"related_works":["https://openalex.org/W2056853153","https://openalex.org/W2057559274","https://openalex.org/W2026924879","https://openalex.org/W2005087563","https://openalex.org/W2378111931","https://openalex.org/W2052388267","https://openalex.org/W2950647290","https://openalex.org/W1968481813","https://openalex.org/W2620829895","https://openalex.org/W2356918560"],"abstract_inverted_index":{"Computing":[0],"the":[1,88,99,144,151,160],"shortest":[2,79,148],"path":[3,80],"between":[4],"a":[5,10,13,128,135],"pair":[6],"of":[7,37,39,43,47,90,101,146],"vertices":[8],"in":[9,16],"graph":[11,17],"is":[12,134,157],"fundamental":[14],"primitive":[15],"algorithmics.":[18],"Classical":[19],"exact":[20],"methods":[21,49,56],"for":[22,127],"this":[23],"problem":[24],"do":[25],"not":[26],"scale":[27,62],"up":[28,63],"to":[29,61,64,76,87,104,142],"contemporary,":[30],"rapidly":[31],"evolving":[32],"social":[33,166],"networks":[34],"with":[35,68,95,108],"hundreds":[36],"millions":[38],"users":[40],"and":[41,111,123,164],"billions":[42],"connections.":[44],"A":[45],"number":[46],"approximate":[48],"have":[50,58],"been":[51,59],"proposed,":[52],"including":[53],"several":[54],"landmark-based":[55,78],"that":[57,140],"shown":[60],"very":[65],"large":[66],"graphs":[67],"acceptable":[69,109],"accuracy.":[70],"This":[71],"paper":[72],"presents":[73],"two":[74],"improvements":[75],"existing":[77],"estimation":[81],"methods.":[82],"The":[83,131,154],"first":[84],"improvement":[85,133],"relates":[86],"use":[89,100],"shortest-path":[91],"trees":[92],"(SPTs).":[93],"Together":[94],"appropriate":[96],"short-cutting":[97],"heuristics,":[98],"SPTs":[102,115],"allows":[103,126],"achieve":[105],"higher":[106],"accuracy":[107],"time":[110],"memory":[112],"overhead.":[113],"Furthermore,":[114],"can":[116],"be":[117],"maintained":[118],"incrementally":[119],"under":[120],"edge":[121],"insertions":[122],"deletions,":[124],"which":[125],"fully-dynamic":[129],"algorithm.":[130],"second":[132],"new":[136],"landmark":[137],"selection":[138],"strategy":[139],"seeks":[141],"maximize":[143],"coverage":[145],"all":[147],"paths":[149],"by":[150],"selected":[152],"landmarks.":[153],"improved":[155],"method":[156],"evaluated":[158],"on":[159],"DBLP,":[161],"Orkut,":[162],"Twitter":[163],"Skype":[165],"networks.":[167]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":7},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}