{"id":"https://openalex.org/W2005945380","doi":"https://doi.org/10.1145/2463676.2465315","title":"Fast exact shortest-path distance queries on large networks by pruned landmark labeling","display_name":"Fast exact shortest-path distance queries on large networks by pruned landmark labeling","publication_year":2013,"publication_date":"2013-06-22","ids":{"openalex":"https://openalex.org/W2005945380","doi":"https://doi.org/10.1145/2463676.2465315","mag":"2005945380"},"language":"en","primary_location":{"id":"doi:10.1145/2463676.2465315","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2463676.2465315","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data","raw_type":"proceedings-article"},"type":"preprint","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/A5102966470","display_name":"Takuya Akiba","orcid":"https://orcid.org/0000-0002-8284-4375"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Takuya Akiba","raw_affiliation_strings":["The University of Tokyo, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"The University of Tokyo, Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101941539","display_name":"Yoichi Iwata","orcid":"https://orcid.org/0000-0001-7990-2987"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yoichi Iwata","raw_affiliation_strings":["The University of Tokyo, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"The University of Tokyo, Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038701345","display_name":"Yuichi Yoshida","orcid":"https://orcid.org/0000-0001-8919-8479"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yuichi Yoshida","raw_affiliation_strings":["National Institute of Informatics, and Preferred Infrastructure, Inc., Tokyo, Japan","National Institute of Informatics & Preferred Infrastructure, Inc., Tokyo, Japan#TAB#"],"affiliations":[{"raw_affiliation_string":"National Institute of Informatics, and Preferred Infrastructure, Inc., Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]},{"raw_affiliation_string":"National Institute of Informatics & Preferred Infrastructure, Inc., Tokyo, Japan#TAB#","institution_ids":["https://openalex.org/I184597095"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102966470"],"corresponding_institution_ids":["https://openalex.org/I74801974"],"apc_list":null,"apc_paid":null,"fwci":26.3577,"has_fulltext":false,"cited_by_count":373,"citation_normalized_percentile":{"value":0.99775138,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"349","last_page":"360"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994999766349792,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9937999844551086,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/computer-science","display_name":"Computer science","score":0.6857914328575134},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.6350845098495483},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6133541464805603},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5747132301330566},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5230863094329834},{"id":"https://openalex.org/keywords/landmark","display_name":"Landmark","score":0.4901517331600189},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4710400402545929},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44053366780281067},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37941208481788635},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2919197082519531},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.26625683903694153}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6857914328575134},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6350845098495483},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6133541464805603},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5747132301330566},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5230863094329834},{"id":"https://openalex.org/C2780297707","wikidata":"https://www.wikidata.org/wiki/Q4895393","display_name":"Landmark","level":2,"score":0.4901517331600189},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4710400402545929},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44053366780281067},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37941208481788635},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2919197082519531},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.26625683903694153},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","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},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2463676.2465315","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2463676.2465315","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.770.298","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.770.298","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1304.4661.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W1560267311","https://openalex.org/W1932416503","https://openalex.org/W1972094496","https://openalex.org/W1981585544","https://openalex.org/W1982184342","https://openalex.org/W1989894867","https://openalex.org/W1994727615","https://openalex.org/W2002722727","https://openalex.org/W2006097619","https://openalex.org/W2008570937","https://openalex.org/W2020880764","https://openalex.org/W2021685712","https://openalex.org/W2034050320","https://openalex.org/W2052703084","https://openalex.org/W2054100908","https://openalex.org/W2061820396","https://openalex.org/W2070207525","https://openalex.org/W2070722739","https://openalex.org/W2073415627","https://openalex.org/W2082773934","https://openalex.org/W2098636939","https://openalex.org/W2099083325","https://openalex.org/W2100132188","https://openalex.org/W2111708605","https://openalex.org/W2111825982","https://openalex.org/W2112513979","https://openalex.org/W2115022330","https://openalex.org/W2116039228","https://openalex.org/W2116391761","https://openalex.org/W2117897639","https://openalex.org/W2140271346","https://openalex.org/W2142517301","https://openalex.org/W2146583842","https://openalex.org/W2146591355","https://openalex.org/W2152306920","https://openalex.org/W2152776677","https://openalex.org/W2154768509","https://openalex.org/W2169015768","https://openalex.org/W2170616854","https://openalex.org/W2172107427","https://openalex.org/W2432978112","https://openalex.org/W2769133055","https://openalex.org/W6649045865"],"related_works":["https://openalex.org/W2056853153","https://openalex.org/W2057559274","https://openalex.org/W2005087563","https://openalex.org/W2378111931","https://openalex.org/W4243161226","https://openalex.org/W2950647290","https://openalex.org/W2620829895","https://openalex.org/W2356918560","https://openalex.org/W1968481813","https://openalex.org/W2912813468"],"abstract_inverted_index":{"We":[0,89],"propose":[1],"a":[2,22],"new":[3],"exact":[4,139],"method":[5,14,113],"for":[6,18,55],"shortest-path":[7],"distance":[8,16,54],"queries":[9],"on":[10,103],"large-scale":[11,107],"networks.":[12,109],"Our":[13],"precomputes":[15],"labels":[17],"vertices":[19,59],"by":[20],"performing":[21],"breadth-first":[23,45,83],"search":[24,67],"from":[25,60],"every":[26],"vertex.":[27],"Seemingly":[28],"too":[29,32],"obvious":[30],"and":[31,69,101,118],"inefficient":[33],"at":[34],"first":[35],"glance,":[36],"the":[37,52,61,66,93,135],"key":[38],"ingredient":[39],"introduced":[40],"here":[41],"is":[42,99],"pruning":[43],"during":[44],"searches.":[46],"While":[47],"we":[48,74,77],"can":[49,78,114],"still":[50],"answer":[51],"correct":[53],"any":[56],"pair":[57],"of":[58,71,95,106,123,125,131,137,147],"labels,":[62],"it":[63],"surprisingly":[64],"reduces":[65],"space":[68],"sizes":[70],"labels.":[72],"Moreover,":[73],"show":[75],"that":[76,92],"perform":[79],"32":[80],"or":[81],"64":[82],"searches":[84],"simultaneously":[85],"exploiting":[86],"bitwise":[87],"operations.":[88],"experimentally":[90],"demonstrate":[91],"combination":[94],"these":[96],"two":[97,129],"techniques":[98],"efficient":[100],"robust":[102],"various":[104],"kinds":[105],"real-world":[108],"In":[110],"particular,":[111],"our":[112],"handle":[115],"social":[116],"networks":[117],"web":[119],"graphs":[120],"with":[121,141],"hundreds":[122],"millions":[124],"edges,":[126],"which":[127],"are":[128],"orders":[130],"magnitude":[132],"larger":[133],"than":[134],"limits":[136],"previous":[138,148],"methods,":[140],"comparable":[142],"query":[143],"time":[144],"to":[145],"those":[146],"methods.":[149]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":28},{"year":2024,"cited_by_count":41},{"year":2023,"cited_by_count":30},{"year":2022,"cited_by_count":36},{"year":2021,"cited_by_count":40},{"year":2020,"cited_by_count":33},{"year":2019,"cited_by_count":36},{"year":2018,"cited_by_count":24},{"year":2017,"cited_by_count":24},{"year":2016,"cited_by_count":24},{"year":2015,"cited_by_count":27},{"year":2014,"cited_by_count":19},{"year":2013,"cited_by_count":10}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}