{"id":"https://openalex.org/W2538876901","doi":"https://doi.org/10.1145/2983323.2983731","title":"Fully Dynamic Shortest-Path Distance Query Acceleration on Massive Networks","display_name":"Fully Dynamic Shortest-Path Distance Query Acceleration on Massive Networks","publication_year":2016,"publication_date":"2016-10-24","ids":{"openalex":"https://openalex.org/W2538876901","doi":"https://doi.org/10.1145/2983323.2983731","mag":"2538876901"},"language":"en","primary_location":{"id":"doi:10.1145/2983323.2983731","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2983323.2983731","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM International on 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/A5028489710","display_name":"Takanori Hayashi","orcid":"https://orcid.org/0000-0002-5189-1865"},"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":"Takanori Hayashi","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/A5102966470","display_name":"Takuya Akiba","orcid":"https://orcid.org/0000-0002-8284-4375"},"institutions":[{"id":"https://openalex.org/I4210166566","display_name":"Preferred Networks (Japan)","ror":"https://ror.org/05xeefy56","country_code":"JP","type":"company","lineage":["https://openalex.org/I4210166566"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takuya Akiba","raw_affiliation_strings":["Preferred Networks, Inc, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Preferred Networks, Inc, Tokyo, Japan","institution_ids":["https://openalex.org/I4210166566"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008961593","display_name":"Ken\u2010ichi Kawarabayashi","orcid":"https://orcid.org/0000-0001-6056-4287"},"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":"Ken-ichi Kawarabayashi","raw_affiliation_strings":["National Institute of Informatics, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"National Institute of Informatics, Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5028489710"],"corresponding_institution_ids":["https://openalex.org/I74801974"],"apc_list":null,"apc_paid":null,"fwci":1.9889,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.87322556,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1533","last_page":"1542"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9993000030517578,"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.9993000030517578,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9986000061035156,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7250484228134155},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6596347093582153},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.6594629883766174},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6155377626419067},{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.4914969205856323},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4570299983024597},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.448982298374176},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41433268785476685},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1954255998134613},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.18772149085998535},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12029480934143066},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11676973104476929}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7250484228134155},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6596347093582153},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.6594629883766174},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6155377626419067},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.4914969205856323},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4570299983024597},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.448982298374176},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41433268785476685},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1954255998134613},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.18772149085998535},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12029480934143066},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11676973104476929},{"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2983323.2983731","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2983323.2983731","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM International on Conference on Information and Knowledge Management","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W19684845","https://openalex.org/W154362522","https://openalex.org/W1512819151","https://openalex.org/W1964731129","https://openalex.org/W1967570846","https://openalex.org/W1971937094","https://openalex.org/W1984336731","https://openalex.org/W1984341657","https://openalex.org/W1994727615","https://openalex.org/W2005945380","https://openalex.org/W2008570937","https://openalex.org/W2014889099","https://openalex.org/W2020880764","https://openalex.org/W2037933327","https://openalex.org/W2054100908","https://openalex.org/W2082773934","https://openalex.org/W2087989168","https://openalex.org/W2098636939","https://openalex.org/W2109309764","https://openalex.org/W2116437000","https://openalex.org/W2126709939","https://openalex.org/W2131997358","https://openalex.org/W2134784378","https://openalex.org/W2140271346","https://openalex.org/W2142126162","https://openalex.org/W2148847267","https://openalex.org/W2154768509","https://openalex.org/W2164900957","https://openalex.org/W2168729706","https://openalex.org/W2172107427","https://openalex.org/W2198195533","https://openalex.org/W2755088640","https://openalex.org/W2764587448","https://openalex.org/W6649045865","https://openalex.org/W6679916693","https://openalex.org/W7015881123"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W2146343568","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2013643406","https://openalex.org/W2027972911","https://openalex.org/W2157978810","https://openalex.org/W4391547476","https://openalex.org/W2597809628"],"abstract_inverted_index":{"The":[0,33],"distance":[1,44,77,224],"between":[2,14],"vertices":[3,138,153],"is":[4,18],"one":[5],"of":[6,21,25,56,120,132,139,146,187,200],"the":[7,19,40,57,70,117,144,161,198,201,217],"most":[8],"fundamental":[9],"measures":[10,24],"for":[11,101],"representing":[12],"relations":[13],"them,":[15],"and":[16,31,61,96],"it":[17],"basis":[20],"other":[22],"classic":[23],"vertices,":[26],"such":[27],"as":[28,39],"similarity,":[29],"centrality,":[30],"influence.":[32],"2-hop":[34],"labeling":[35],"methods":[36],"are":[37],"known":[38],"fastest":[41],"exact":[42,76],"point-to-point":[43],"algorithms":[45],"on":[46,79,204,209,230],"million-scale":[47],"networks.":[48,122,195,206],"However,":[49],"they":[50],"cannot":[51],"handle":[52,176,192],"billion-scale":[53,82,103,177],"networks":[54,83,104,140,178,212],"because":[55],"large":[58],"space":[59],"requirement":[60],"long":[62],"preprocessing":[63],"time.":[64],"In":[65,166,207],"this":[66],"paper,":[67],"we":[68,108,124,182],"present":[69],"first":[71],"algorithm":[72],"that":[73,115],"can":[74],"process":[75],"queries":[78,225],"fully":[80,193],"dynamic":[81,184,194],"besides":[84],"trivial":[85],"non-indexing":[86],"algorithms,":[87],"which":[88,147],"combines":[89],"an":[90,97],"online":[91],"bidirectional":[92,110,158],"breadth-first":[93],"search":[94],"(BFS)":[95],"offline":[98],"indexing":[99],"method":[100,203,219],"handling":[102],"in":[105,141,179,226],"memory.":[106,180],"First,":[107],"accelerate":[109],"BFSs":[111],"by":[112],"using":[113],"heuristics":[114],"exploit":[116],"small-world":[118],"property":[119],"complex":[121],"Then,":[123],"construct":[125],"bit-parallel":[126],"shortest-path":[127],"trees":[128],"to":[129,150,175,191,222],"maintain":[130],"sets":[131],"shortest":[133],"paths":[134],"passing":[135],"through":[136],"high-degree":[137],"compact":[142],"form,":[143],"information":[145],"enables":[148,173,220],"us":[149,174,221],"avoid":[151],"visiting":[152],"with":[154,213],"high":[155],"degrees":[156],"during":[157],"BFSs.":[159],"Thus,":[160],"searches":[162],"achieve":[163],"considerable":[164],"speedup.":[165],"addition,":[167],"our":[168,188],"index":[169],"size":[170],"reduction":[171],"technique":[172],"Furthermore,":[181],"introduce":[183],"update":[185],"procedures":[186],"data":[189],"structure":[190],"We":[196],"evaluated":[197],"performance":[199],"proposed":[202,218],"real-world":[205],"particular,":[208],"large-scale":[210],"social":[211],"over":[214],"1B":[215],"edges,":[216],"answer":[223],"around":[227],"1":[228],"ms,":[229],"average.":[231]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}