{"id":"https://openalex.org/W3170339516","doi":"https://doi.org/10.1145/3406325.3451025","title":"Decremental all-pairs shortest paths in deterministic near-linear time","display_name":"Decremental all-pairs shortest paths in deterministic near-linear time","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3170339516","doi":"https://doi.org/10.1145/3406325.3451025","mag":"3170339516"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3451025","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451025","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5056023203","display_name":"Julia Chuzhoy","orcid":"https://orcid.org/0000-0001-7839-751X"},"institutions":[{"id":"https://openalex.org/I160992636","display_name":"Toyota Technological Institute at Chicago","ror":"https://ror.org/02sn5gb64","country_code":"US","type":"education","lineage":["https://openalex.org/I160992636"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Julia Chuzhoy","raw_affiliation_strings":["Toyota Technological Institute at Chicago, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Toyota Technological Institute at Chicago, USA","institution_ids":["https://openalex.org/I160992636"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056023203"],"corresponding_institution_ids":["https://openalex.org/I160992636"],"apc_list":null,"apc_paid":null,"fwci":6.535,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.98001599,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"626","last_page":"639"},"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.9995999932289124,"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.9995999932289124,"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.9993000030517578,"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/T11106","display_name":"Data Management and Algorithms","score":0.9919000267982483,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8099863529205322},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7343993782997131},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6222022175788879},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.6072747707366943},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4952830374240875},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4892725646495819},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4639648199081421},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4627307653427124},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4246987998485565},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4234030842781067},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.4202296733856201},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.41869041323661804},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3554127812385559},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.3138299584388733},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2724313735961914},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.05703634023666382}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8099863529205322},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7343993782997131},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6222022175788879},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.6072747707366943},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4952830374240875},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4892725646495819},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4639648199081421},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4627307653427124},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4246987998485565},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4234030842781067},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.4202296733856201},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.41869041323661804},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3554127812385559},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.3138299584388733},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2724313735961914},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.05703634023666382},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3406325.3451025","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451025","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1620005333","display_name":"AF: Small: Graph Theory and Its Uses in Algorithms and Beyond","funder_award_id":"2006464","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W1560003866","https://openalex.org/W1921009182","https://openalex.org/W1984361668","https://openalex.org/W2015725509","https://openalex.org/W2038084411","https://openalex.org/W2039303552","https://openalex.org/W2044343300","https://openalex.org/W2063860324","https://openalex.org/W2075459377","https://openalex.org/W2084803275","https://openalex.org/W2093455937","https://openalex.org/W2116633957","https://openalex.org/W2117595194","https://openalex.org/W2126166149","https://openalex.org/W2141653564","https://openalex.org/W2150148016","https://openalex.org/W2150865801","https://openalex.org/W2153715991","https://openalex.org/W2156047991","https://openalex.org/W2248152086","https://openalex.org/W2342666984","https://openalex.org/W2418286382","https://openalex.org/W2570014581","https://openalex.org/W2797929180","https://openalex.org/W2903365982","https://openalex.org/W2912637539","https://openalex.org/W2913063022","https://openalex.org/W2950039944","https://openalex.org/W2952708184","https://openalex.org/W2980994391","https://openalex.org/W2997227446","https://openalex.org/W2998265589","https://openalex.org/W3018088442","https://openalex.org/W3087342849","https://openalex.org/W3101090353","https://openalex.org/W3125058277","https://openalex.org/W4231553787","https://openalex.org/W4238252746","https://openalex.org/W4247996958","https://openalex.org/W4250700905","https://openalex.org/W4255005259","https://openalex.org/W4297802523","https://openalex.org/W6696975540"],"related_works":["https://openalex.org/W4293054712","https://openalex.org/W2018146256","https://openalex.org/W2375775343","https://openalex.org/W2237480599","https://openalex.org/W2133099431","https://openalex.org/W2198982833","https://openalex.org/W2002764510","https://openalex.org/W1504745067","https://openalex.org/W2040572217","https://openalex.org/W2779966368"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,16,69,72,82,86,92],"decremental":[3],"All-Pairs":[4],"Shortest":[5],"Paths":[6],"(APSP)":[7],"problem":[8,17],"in":[9,76],"undirected":[10,20],"edge-weighted":[11],"graphs.":[12],"The":[13,38],"input":[14],"to":[15,41,60],"is":[18,40,64,81,89],"an":[19,32],"n-vertex":[21],"m-edge":[22],"graph":[23,99],"G":[24],"with":[25],"non-negative":[26],"lengths":[27],"on":[28],"edges,":[29],"that":[30],"undergoes":[31],"online":[33],"sequence":[34],"of":[35,50,52,68,71,85,91],"edge":[36],"deletions.":[37],"goal":[39],"support":[42],"approximate":[43],"shortest-paths":[44],"queries:":[45],"given":[46],"a":[47,55],"pair":[48],"x,y":[49],"vertices":[51],"G,":[53],"return":[54],"path":[56],"P":[57],"connecting":[58],"x":[59],"y,":[61],"whose":[62],"length":[63,70],"within":[65],"factor":[66,84],"\u03b1":[67,80],"shortest":[73],"x-y":[74],"path,":[75],"time":[77],"\u00d5(|E(P)|),":[78],"where":[79],"approximation":[83],"algorithm.":[87],"APSP":[88],"one":[90],"most":[93],"basic":[94],"and":[95],"extensively":[96],"studied":[97],"dynamic":[98],"problems.":[100]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":5}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}