{"id":"https://openalex.org/W4399524176","doi":"https://doi.org/10.1145/3618260.3649695","title":"Fully Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time","display_name":"Fully Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399524176","doi":"https://doi.org/10.1145/3618260.3649695"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649695","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649695","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649695","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649695","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063818718","display_name":"Xiao Mao","orcid":"https://orcid.org/0000-0002-1224-9730"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Xiao Mao","raw_affiliation_strings":["Stanford University, Stanford, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5063818718"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.09945181,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1141","last_page":"1152"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"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/combinatorics","display_name":"Combinatorics","score":0.652883768081665},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.59847491979599},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.576204776763916},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.5603959560394287},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5540348291397095},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49490994215011597},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4434784948825836},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.43123912811279297},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4265821576118469},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.4264286458492279},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4256516396999359},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4248814880847931},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41636669635772705},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39328649640083313},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39290836453437805},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36924535036087036}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.652883768081665},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.59847491979599},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.576204776763916},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.5603959560394287},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5540348291397095},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49490994215011597},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4434784948825836},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.43123912811279297},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4265821576118469},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4264286458492279},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4256516396999359},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4248814880847931},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41636669635772705},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39328649640083313},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39290836453437805},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36924535036087036},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3618260.3649695","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649695","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649695","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649695","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649695","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649695","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.5699999928474426,"id":"https://metadata.un.org/sdg/13","display_name":"Climate action"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399524176.pdf","grobid_xml":"https://content.openalex.org/works/W4399524176.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W1554407673","https://openalex.org/W1601919219","https://openalex.org/W1968023964","https://openalex.org/W1983179262","https://openalex.org/W1999123717","https://openalex.org/W2007572995","https://openalex.org/W2017675289","https://openalex.org/W2022980325","https://openalex.org/W2028558845","https://openalex.org/W2028750248","https://openalex.org/W2058084873","https://openalex.org/W2064790310","https://openalex.org/W2084224084","https://openalex.org/W2085849292","https://openalex.org/W2097458838","https://openalex.org/W2104734478","https://openalex.org/W2115271283","https://openalex.org/W2120994821","https://openalex.org/W2130674086","https://openalex.org/W2137582581","https://openalex.org/W2146685142","https://openalex.org/W2169528473","https://openalex.org/W2248152086","https://openalex.org/W2342666984","https://openalex.org/W2762935521","https://openalex.org/W2768149714","https://openalex.org/W2779121958","https://openalex.org/W2888518448","https://openalex.org/W2949477394","https://openalex.org/W2952708184","https://openalex.org/W2971800005","https://openalex.org/W2996650128","https://openalex.org/W2997310712","https://openalex.org/W2998265589","https://openalex.org/W3125058277","https://openalex.org/W3170339516","https://openalex.org/W3186466528","https://openalex.org/W4220694210","https://openalex.org/W4252982529","https://openalex.org/W4316652282","https://openalex.org/W4402702676"],"related_works":["https://openalex.org/W651485002","https://openalex.org/W2391130892","https://openalex.org/W4293054712","https://openalex.org/W2360981904","https://openalex.org/W2358661218","https://openalex.org/W2354846196","https://openalex.org/W2597144308","https://openalex.org/W2347245430","https://openalex.org/W2392078542","https://openalex.org/W1617152041"],"abstract_inverted_index":{"The":[0],"All-Pairs":[1],"Shortest":[2],"Paths":[3],"(APSP)":[4],"problem":[5,32],"is":[6,91,185],"one":[7],"of":[8,23,33,104,126,191,205],"the":[9,20,30,35,78,101,105,174,180,189,213],"fundamental":[10],"problems":[11],"in":[12,140,167],"theoretical":[13],"computer":[14],"science.":[15],"It":[16,133],"asks":[17],"to":[18,93,109,116,121],"compute":[19],"distance":[21,36],"matrix":[22,37],"a":[24,39,49,162,200,216],"given":[25],"n-vertex":[26],"graph.":[27],"We":[28],"revisit":[29],"classical":[31],"maintaining":[34],"under":[38],"fully":[40],"dynamic":[41],"setting":[42],"undergoing":[43],"vertex":[44],"insertions":[45],"and":[46,54,74,95,112],"deletions":[47],"with":[48,61,86,199],"fast":[50],"worst-case":[51,83,145],"running":[52,84,124,166],"time":[53,85,125,147,171],"efficient":[55,87],"space":[56,88,102,177],"usage.":[57],"Although":[58],"an":[59],"algorithm":[60,81,107,139,165],"amortized":[62],"update-time":[63],"\u00d5(n":[64,117,127,169,175],"2)":[65,118,176],"has":[66,134],"been":[67,135],"known":[68],"for":[69,82],"nearly":[70],"two":[71],"decades":[72],"[Demetrescu":[73],"Italiano,":[75],"STOC":[76],"2003],":[77],"current":[79],"best":[80],"usage":[89,103],"runs":[90],"due":[92,108],"[Gutenberg":[94],"Wulff-Nilsen,":[96],"SODA":[97,114],"2020],":[98],"which":[99,195],"improves":[100],"previous":[106,181],"[Abraham,":[110],"Chechik,":[111],"Krinninger,":[113],"2017]":[115],"but":[119],"fails":[120],"improve":[122],"their":[123],"2":[128,130],"+":[129],"/":[131],"3).":[132],"conjectured":[136,157],"that":[137,207],"no":[138],"O(n":[141],"2.5":[142],"\u2212":[143],"\u0454)":[144],"update":[146],"exists.":[148],"For":[149],"graphs":[150],"without":[151],"negative":[152],"cycles,":[153],"we":[154,211],"meet":[155],"this":[156],"lower":[158],"bound":[159,178],"by":[160,188,215],"introducing":[161],"Monte":[163],"Carlo":[164],"randomized":[168],"2.5)":[170],"while":[172],"keeping":[173],"from":[179],"algorithm.":[182],"Our":[183],"breakthrough":[184],"made":[186],"possible":[187],"idea":[190],"\u201chop-dominant":[192],"shortest":[193,197,209],"paths,\u201d":[194],"are":[196],"paths":[198],"constraint":[201,214],"on":[202],"hops":[203],"(number":[204],"vertices)":[206],"remain":[208],"after":[210],"relax":[212],"constant":[217],"factor.":[218]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}