{"id":"https://openalex.org/W3196332098","doi":"https://doi.org/10.4230/lipics.esa.2021.14","title":"Incremental SCC Maintenance in Sparse Graphs","display_name":"Incremental SCC Maintenance in Sparse Graphs","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3196332098","doi":"https://doi.org/10.4230/lipics.esa.2021.14","mag":"3196332098"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:14595","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.14","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.14","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033889707","display_name":"Aaron Bernstein","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bernstein, Aaron","raw_affiliation_strings":["Rutgers University, New Brunswick, NJ, USA","SAS - Computer Science"],"affiliations":[{"raw_affiliation_string":"Rutgers University, New Brunswick, NJ, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"SAS - Computer Science","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000225226","display_name":"Aditi Dudeja","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dudeja, Aditi","raw_affiliation_strings":["Rutgers University, New Brunswick, NJ, USA","Rutgers - The State University of New Jersey, New Brunswick"],"affiliations":[{"raw_affiliation_string":"Rutgers University, New Brunswick, NJ, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Rutgers - The State University of New Jersey, New Brunswick","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076564426","display_name":"Seth Pettie","orcid":"https://orcid.org/0000-0002-0495-3904"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pettie, Seth","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI, USA","University of Michigan Ann Arbor"],"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"University of Michigan Ann Arbor","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5033889707"],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":null,"apc_paid":null,"fwci":0.6112,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.69988604,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.993399977684021,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.993399977684021,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.6871815919876099},{"id":"https://openalex.org/keywords/topological-sorting","display_name":"Topological sorting","score":0.6613532304763794},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.657132625579834},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5017588138580322},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49096062779426575},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4622623026371002},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.43498650193214417},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4255583882331848},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40485507249832153},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3371298015117645},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33590438961982727},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.18179425597190857},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.15137064456939697}],"concepts":[{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.6871815919876099},{"id":"https://openalex.org/C176032523","wikidata":"https://www.wikidata.org/wiki/Q753127","display_name":"Topological sorting","level":3,"score":0.6613532304763794},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.657132625579834},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5017588138580322},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49096062779426575},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4622623026371002},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.43498650193214417},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4255583882331848},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40485507249832153},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3371298015117645},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33590438961982727},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.18179425597190857},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.15137064456939697}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:14595","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.14","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.esa.2021.14","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2021.14","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:14595","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.14","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2090339428","https://openalex.org/W2547436936","https://openalex.org/W1563127162","https://openalex.org/W3036315659","https://openalex.org/W2617873545","https://openalex.org/W2008441811","https://openalex.org/W2795065148","https://openalex.org/W3080569475","https://openalex.org/W3104783836","https://openalex.org/W2495681423","https://openalex.org/W2742867136","https://openalex.org/W3020746289","https://openalex.org/W2497890598","https://openalex.org/W2774158340","https://openalex.org/W2281382292","https://openalex.org/W3022547913","https://openalex.org/W3082952831","https://openalex.org/W1522171595","https://openalex.org/W2060981730","https://openalex.org/W89012087"],"abstract_inverted_index":{"In":[0,254],"the":[1,16,21,24,36,50,83,89,97,124,195,198,204,244,263,297,317,345],"incremental":[2,37,112,121,201,209,236,283],"cycle":[3,101,128,210],"detection":[4,129,211],"problem,":[5,40],"edges":[6,42],"are":[7,43],"added":[8,44],"to":[9,19,45,54,154,235,270,327,334,339],"a":[10,56,100,107,182,241,278,305,331,349],"directed":[11,134,165,272,341],"graph":[12],"(initially":[13],"empty),":[14],"and":[15,49,74,130,147,159,174,188,192,212,216,219,221,267,301,312,343,352],"algorithm":[17,51,281,298],"has":[18],"report":[20],"presence":[22,98],"of":[23,94,99,109,114,169,186,197,265,291,299,319,356],"first":[25],"cycle,":[26],"once":[27],"it":[28],"is":[29,35,52,102,194,240,304],"formed.":[30],"A":[31,293],"closely":[32,251],"related":[33,252],"problem":[34],"topological":[38,58,131,161,213],"sort":[39,132,162,214],"where":[41],"an":[46,286],"acyclic":[47,135],"graph,":[48],"required":[53],"maintain":[55,155],"valid":[57],"ordering.":[59],"Since":[60],"these":[61,95,110,249],"problems":[62],"arise":[63],"naturally":[64],"in":[65,82,92,123,133,163,296,310],"many":[66,93],"applications":[67],"such":[68,137],"as":[69,138],"scheduling":[70],"tasks,":[71],"pointer":[72],"analysis,":[73],"circuit":[75],"evaluation,":[76],"they":[77],"have":[78,181],"been":[79],"studied":[80],"extensively":[81],"last":[84],"three":[85],"decades.":[86],"Motivated":[87],"by":[88,140,261],"fact":[90],"that":[91,315],"applications,":[96],"not":[103,233],"fatal,":[104],"we":[105,257,276,347],"study":[106],"generalization":[108],"problems,":[111],"maintenance":[113],"strongly":[115,156],"connected":[116,157],"components":[117,158],"(incremental":[118],"SCC).":[119],"Several":[120],"algorithms":[122,168,207,247],"literature":[125],"which":[126,224],"do":[127,232],"graphs,":[136,342],"those":[139],"[Michael":[141,175],"A.":[142,176],"Bender":[143,177],"et":[144,149,171,178],"al.,":[145,150,172,179],"2016]":[146,180],"[Haeupler":[148,170],"2012],":[151],"also":[152],"generalize":[153],"their":[160],"general":[164,271,340],"graphs.":[166,273],"The":[167],"2012]":[173],"total":[183,226,288],"update":[184,228,289],"time":[185,229,290],"O(m^{3/2})":[187],"O(m\u22c5":[189],"min{m^{1/2},n^{2/3}})":[190],"respectively,":[191],"this":[193,255,259,323,336,357],"state":[196],"art":[199],"for":[200,208,248,282],"SCC.":[202,237],"But":[203],"most":[205],"recent":[206],"([Bernstein":[215],"Chechik,":[217,313],"2018]":[218],"[Bhattacharya":[220,266,300],"Kulkarni,":[222,268,302],"2020]),":[223],"yield":[225],"(randomized)":[227],"\u00d5(min{m^{4/3},":[230],"n\u00b2}),":[231],"extend":[234,335],"Thus,":[238],"there":[239],"gap":[242,260],"between":[243],"best":[245],"known":[246],"two":[250],"problems.":[253],"paper,":[256],"bridge":[258],"extending":[262],"framework":[264],"2020]":[269,303],"More":[274],"concretely,":[275],"give":[277],"Las":[279],"Vegas":[280],"SCCs":[284],"with":[285],"expected":[287],"\u00d5(m^{4/3}).":[292],"key":[294],"ingredient":[295],"structural":[306,337],"theorem":[307,324,338],"(first":[308],"introduced":[309],"[Bernstein":[311],"2018])":[314],"bounds":[316],"number":[318],"\"equivalent\"":[320],"vertices.":[321],"Unfortunately,":[322],"only":[325],"applies":[326],"DAGs.":[328],"We":[329],"show":[330],"natural":[332],"way":[333,346],"along":[344],"develop":[348],"significantly":[350],"simpler":[351],"more":[353],"intuitive":[354],"proof":[355],"theorem.":[358]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}