{"id":"https://openalex.org/W3030668353","doi":"https://doi.org/10.1145/3318464.3389737","title":"Hub Labeling for Shortest Path Counting","display_name":"Hub Labeling for Shortest Path Counting","publication_year":2020,"publication_date":"2020-05-29","ids":{"openalex":"https://openalex.org/W3030668353","doi":"https://doi.org/10.1145/3318464.3389737","mag":"3030668353"},"language":"en","primary_location":{"id":"doi:10.1145/3318464.3389737","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3318464.3389737","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data","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/A5101772111","display_name":"Yikai Zhang","orcid":"https://orcid.org/0000-0003-4924-7824"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yikai Zhang","raw_affiliation_strings":["Chinese University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Chinese University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075642293","display_name":"Jeffrey Xu Yu","orcid":"https://orcid.org/0000-0002-9738-827X"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jeffrey Xu Yu","raw_affiliation_strings":["Chinese University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Chinese University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101772111"],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":0.7849,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.74061638,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1813","last_page":"1828"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9987000226974487,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7685636281967163},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6963793039321899},{"id":"https://openalex.org/keywords/betweenness-centrality","display_name":"Betweenness centrality","score":0.5741618275642395},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5086975693702698},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49699667096138},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.4330589473247528},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4128500819206238},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27360793948173523},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21155500411987305}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7685636281967163},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6963793039321899},{"id":"https://openalex.org/C117045392","wikidata":"https://www.wikidata.org/wiki/Q4899215","display_name":"Betweenness centrality","level":3,"score":0.5741618275642395},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5086975693702698},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49699667096138},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.4330589473247528},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4128500819206238},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27360793948173523},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21155500411987305},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3318464.3389737","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3318464.3389737","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W30435042","https://openalex.org/W154362522","https://openalex.org/W190901240","https://openalex.org/W328847996","https://openalex.org/W1029409534","https://openalex.org/W1489273657","https://openalex.org/W1493214567","https://openalex.org/W1740620250","https://openalex.org/W1967066104","https://openalex.org/W1981585544","https://openalex.org/W1981733737","https://openalex.org/W1984336731","https://openalex.org/W1994727615","https://openalex.org/W1994924587","https://openalex.org/W2003408562","https://openalex.org/W2005945380","https://openalex.org/W2006097619","https://openalex.org/W2014889099","https://openalex.org/W2020880764","https://openalex.org/W2038643780","https://openalex.org/W2041172083","https://openalex.org/W2052703084","https://openalex.org/W2062153469","https://openalex.org/W2081863845","https://openalex.org/W2096304152","https://openalex.org/W2100132188","https://openalex.org/W2101778955","https://openalex.org/W2112513979","https://openalex.org/W2115826669","https://openalex.org/W2116437000","https://openalex.org/W2120783268","https://openalex.org/W2122595065","https://openalex.org/W2131692673","https://openalex.org/W2137874581","https://openalex.org/W2146583842","https://openalex.org/W2171707538","https://openalex.org/W2254833717","https://openalex.org/W2288961969","https://openalex.org/W2396103472","https://openalex.org/W2533446415","https://openalex.org/W2575116237","https://openalex.org/W2579664199","https://openalex.org/W2764587448","https://openalex.org/W2791658191","https://openalex.org/W2798620495","https://openalex.org/W2902089463","https://openalex.org/W2948227434","https://openalex.org/W2949093975","https://openalex.org/W2952116439"],"related_works":["https://openalex.org/W2018146256","https://openalex.org/W4293054712","https://openalex.org/W2347245430","https://openalex.org/W3149063625","https://openalex.org/W3032870653","https://openalex.org/W2198982833","https://openalex.org/W2375775343","https://openalex.org/W2094515718","https://openalex.org/W2237480599","https://openalex.org/W2348504720"],"abstract_inverted_index":{"The":[0],"notion":[1],"of":[2,35,40,49,89,105,116,126,128],"shortest":[3,23,41],"path":[4],"is":[5],"fundamental":[6],"in":[7,47,52,118,134],"graph":[8,72,95],"analytics.":[9],"While":[10],"many":[11],"works":[12],"have":[13],"devoted":[14],"to":[15,20,75,124],"devising":[16],"efficient":[17],"distance":[18,24],"oracles":[19],"compute":[21],"the":[22,33,38,77,87,90,101,106],"between":[25,43],"any":[26],"vertices":[27],"s":[28,44],"and":[29,45,69,103],"t,":[30],"we":[31,59,81],"study":[32,99],"problem":[34],"efficiently":[36],"counting":[37],"number":[39],"paths":[42],"t":[46],"light":[48],"its":[50],"applications":[51],"tasks":[53],"such":[54],"as":[55],"betweenness-related":[56],"analysis.":[57],"Specifically,":[58],"propose":[60],"a":[61,110],"hub":[62,67],"labeling":[63],"scheme":[64,91],"based":[65],"on":[66,86],"pushing":[68],"discuss":[70],"several":[71,83],"reduction":[73],"techniques":[74],"reduce":[76],"index":[78],"size.":[79],"Furthermore,":[80],"prove":[82],"theoretical":[84],"results":[85],"performance":[88],"for":[92,120],"some":[93],"special":[94],"classes.":[96],"Our":[97],"empirical":[98],"verifies":[100],"efficiency":[102],"effectiveness":[104],"algorithms.":[107],"In":[108],"particular,":[109],"query":[111],"evaluation":[112],"takes":[113],"only":[114],"hundreds":[115,125],"microseconds":[117],"average":[119],"graphs":[121],"with":[122],"up":[123],"millions":[127],"edges.":[129],"We":[130],"report":[131],"our":[132],"findings":[133],"this":[135],"paper.":[136]},"counts_by_year":[{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4}],"updated_date":"2026-03-28T08:17:26.163206","created_date":"2025-10-10T00:00:00"}