{"id":"https://openalex.org/W2909578366","doi":"https://doi.org/10.1137/20m1312149","title":"Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time","display_name":"Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time","publication_year":2021,"publication_date":"2021-12-14","ids":{"openalex":"https://openalex.org/W2909578366","doi":"https://doi.org/10.1137/20m1312149","mag":"2909578366"},"language":"en","primary_location":{"id":"doi:10.1137/20m1312149","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1312149","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5033889707","display_name":"Aaron Bernstein","orcid":null},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Aaron Bernstein","raw_affiliation_strings":["Rutgers University New Brunswick, Department of Computer Science \u2020 BARC, University of Copenhagen, Universitetsparken 1, Copenhagen 2100, Denmark,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University New Brunswick, Department of Computer Science \u2020 BARC, University of Copenhagen, Universitetsparken 1, Copenhagen 2100, Denmark,","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015325792","display_name":"Maximilian Probst Gutenberg","orcid":"https://orcid.org/0000-0003-3522-156X"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Maximilian Probst Gutenberg","raw_affiliation_strings":["Rutgers University New Brunswick, Department of Computer Science \u2020 BARC, University of Copenhagen, Universitetsparken 1, Copenhagen 2100, Denmark,"],"raw_orcid":"https://orcid.org/0000-0003-3522-156X","affiliations":[{"raw_affiliation_string":"Rutgers University New Brunswick, Department of Computer Science \u2020 BARC, University of Copenhagen, Universitetsparken 1, Copenhagen 2100, Denmark,","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077977985","display_name":"Christian Wulff\u2010Nilsen","orcid":"https://orcid.org/0000-0002-3699-7821"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Christian Wulff-Nilsen","raw_affiliation_strings":["Rutgers University New Brunswick, Department of Computer Science \u2020 BARC, University of Copenhagen, Universitetsparken 1, Copenhagen 2100, Denmark,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University New Brunswick, Department of Computer Science \u2020 BARC, University of Copenhagen, Universitetsparken 1, Copenhagen 2100, Denmark,","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5033889707"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":null,"apc_paid":null,"fwci":0.3028,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.57707303,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"52","issue":"2","first_page":"STOC19","last_page":"128"},"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.9990000128746033,"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.9990000128746033,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9987000226974487,"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/T10237","display_name":"Cryptography and Data Security","score":0.9973999857902527,"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/reachability","display_name":"Reachability","score":0.8080476522445679},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5190585255622864},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4478493928909302},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42200398445129395},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3509986400604248},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34971338510513306}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8080476522445679},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5190585255622864},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4478493928909302},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42200398445129395},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3509986400604248},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34971338510513306}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/20m1312149","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1312149","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/0da4e02a-01cb-41f3-a65e-dee9f76b43ed","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/0da4e02a-01cb-41f3-a65e-dee9f76b43ed","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bernstein , A , Gutenberg , M P & Wulff-Nilsen , C 2023 , ' Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time ' , SIAM Journal on Computing , vol. 52 , no. 2 , pp. 128-155 . https://doi.org/10.1137/20M1312149","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/21656ad6-c8c2-414b-99eb-4e2898c058fd","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85068764114&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4422840520","display_name":null,"funder_award_id":"16582","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"},{"id":"https://openalex.org/G7371944007","display_name":null,"funder_award_id":"1942010","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"},{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"},{"id":"https://openalex.org/F4320327714","display_name":"ETH Z\u00fcrich Foundation","ror":null},{"id":"https://openalex.org/F4320334966","display_name":"Bhabha Atomic Research Centre","ror":"https://ror.org/05w6wfp17"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W653534090","https://openalex.org/W1513400187","https://openalex.org/W1554407673","https://openalex.org/W1558383352","https://openalex.org/W1886894033","https://openalex.org/W1982440947","https://openalex.org/W2001920780","https://openalex.org/W2010151376","https://openalex.org/W2035767178","https://openalex.org/W2037034819","https://openalex.org/W2045430818","https://openalex.org/W2055688322","https://openalex.org/W2085849292","https://openalex.org/W2095571038","https://openalex.org/W2097490969","https://openalex.org/W2116633957","https://openalex.org/W2118382442","https://openalex.org/W2130674086","https://openalex.org/W2141653564","https://openalex.org/W2146507303","https://openalex.org/W2153715991","https://openalex.org/W2401697020","https://openalex.org/W2418286382","https://openalex.org/W2522910400","https://openalex.org/W2570014581","https://openalex.org/W2611854190","https://openalex.org/W2618849866","https://openalex.org/W2752885492","https://openalex.org/W2792348861","https://openalex.org/W2964260809","https://openalex.org/W2964264613","https://openalex.org/W3002774327","https://openalex.org/W3020969699","https://openalex.org/W3035518111","https://openalex.org/W3100139999","https://openalex.org/W3103270367","https://openalex.org/W3117596577","https://openalex.org/W3127039040","https://openalex.org/W3127776752","https://openalex.org/W3128057791","https://openalex.org/W4238411931","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2127267268","https://openalex.org/W2136512912","https://openalex.org/W2067910792","https://openalex.org/W2156446763","https://openalex.org/W2143461633","https://openalex.org/W2150194458","https://openalex.org/W4321471459","https://openalex.org/W2141183298","https://openalex.org/W2315923944"],"abstract_inverted_index":{"Computing":[0],"the":[1,50,61,95,104,117,141,145,174,181,215],"strongly":[2],"connected":[3],"Components":[4],"(SCCs)":[5],"in":[6,106,173,192],"a":[7,113,160],"graph":[8],"G":[9],"=":[10,34,37,131,135,222],"(V,":[11],"E)":[12],"is":[13],"known":[14],"to":[15,74,125,155,168,212],"take":[16],"only":[17,112],"O(m+n)":[18],"time":[19,52,80,109,198,202],"using":[20],"an":[21],"algorithm":[22,97,143,219],"by":[23,56],"Tarjan":[24],"[SIAM":[25],"J.":[26],"Comput.,":[27],"1":[28],"(1972),":[29],"pp.":[30],"146-160]":[31],"where":[32],"m":[33],"|E|,":[35],"n":[36],"|V":[38],"|.":[39],"For":[40],"fully":[41,175,193],"dynamic":[42,176,194],"graphs,":[43,83],"conditional":[44],"lower":[45],"bounds":[46],"provide":[47],"evidence":[48],"that":[49,86,102],"update":[51,79,108,197],"cannot":[53],"be":[54,153],"improved":[55],"polynomial":[57],"factors":[58,214],"over":[59],"recomputing":[60],"SCCs":[62,105],"from":[63,116],"scratch":[64],"after":[65],"every":[66],"update.":[67],"Nevertheless,":[68],"substantial":[69],"progress":[70],"has":[71],"been":[72],"made":[73],"find":[75],"algorithms":[76],"with":[77,196],"fast":[78],"for":[81,98,144,204,220],"decremental":[82,100,146,166],"i.e.,":[84,129],"graphs":[85,101,195],"undergo":[87],"edge":[88],"deletions.":[89],"In":[90],"this":[91,210],"paper,":[92],"we":[93,163],"present":[94],"first":[96],"general":[99],"maintains":[103],"total":[107],"O(m),":[110],"thus":[111],"polylogarithmic":[114,213],"factor":[115],"optimal":[118],"running":[119],"time.":[120],"(We":[121],"use":[122,164],"O(f(n))":[123,132],"notation":[124],"suppress":[126],"logarithmic":[127],"factors,":[128],"g(n)":[130,134],"if":[133],"O(f(n)polylog(n)).)":[136],"Our":[137],"result":[138,167],"also":[139],"yields":[140],"fastest":[142],"single-source":[147],"reachability":[148,182,218],"(SSR)":[149],"problem":[150],"which":[151],"can":[152,179],"reduced":[154],"decrementally":[156],"maintaining":[157],"SCCs.":[158],"Using":[159],"well-known":[161],"reduction,":[162],"our":[165],"achieve":[169],"new":[170],"update/query-time":[171],"trade-offs":[172],"setting.":[177],"We":[178],"maintain":[180],"of":[183],"pairs":[184],"S":[185,189,221],"\u00d7":[186],"V":[187,191,223],",":[188],"\u2286":[190],"O(<sup>|S|m</sup><sub>t</sub>)":[199],"and":[200],"query":[201],"O(t)":[203],"all":[205],"t":[206],"\u220a":[207],"[1,":[208],"|S|];":[209],"matches":[211],"best":[216],"all-pairs":[217],".":[224]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}