{"id":"https://openalex.org/W4400090660","doi":"https://doi.org/10.1007/s00224-024-10181-z","title":"Good r-divisions Imply Optimal Amortized Decremental Biconnectivity","display_name":"Good r-divisions Imply Optimal Amortized Decremental Biconnectivity","publication_year":2024,"publication_date":"2024-06-27","ids":{"openalex":"https://openalex.org/W4400090660","doi":"https://doi.org/10.1007/s00224-024-10181-z"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-024-10181-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-024-10181-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-024-10181-z.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00224-024-10181-z.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025874799","display_name":"Jacob Holm","orcid":"https://orcid.org/0000-0001-6997-9251"},"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":"Jacob Holm","raw_affiliation_strings":["University of Copenhagen, Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004695759","display_name":"Eva Rotenberg","orcid":"https://orcid.org/0000-0001-5853-7909"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Eva Rotenberg","raw_affiliation_strings":["Technical University of Denmark, Kongens Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"Technical University of Denmark, Kongens Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004695759","https://openalex.org/A5025874799"],"corresponding_institution_ids":["https://openalex.org/I124055696","https://openalex.org/I96673099"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.7361,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.72668329,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"68","issue":"4","first_page":"1014","last_page":"1048"},"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9976999759674072,"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/amortized-analysis","display_name":"Amortized analysis","score":0.4143667221069336},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39239799976348877},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3804835379123688},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32094329595565796},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11721429228782654},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.06921753287315369}],"concepts":[{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.4143667221069336},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39239799976348877},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3804835379123688},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32094329595565796},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11721429228782654},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.06921753287315369}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00224-024-10181-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-024-10181-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-024-10181-z.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/d6fba80b-fe31-435b-ad1f-680f153b3bd9","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/d6fba80b-fe31-435b-ad1f-680f153b3bd9","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Holm , J & Rotenberg , E 2024 , ' Good r-divisions Imply Optimal Amortized Decremental Biconnectivity ' , Theory of Computing Systems , vol. 68 , no. 4 , pp. 1014-1048 . https://doi.org/10.1007/s00224-024-10181-z","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s00224-024-10181-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-024-10181-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-024-10181-z.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4386571806","display_name":null,"funder_award_id":"2020-2023 (9131-00044B)","funder_id":"https://openalex.org/F4320322928","funder_display_name":"Danmarks Frie Forskningsfond"},{"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/G5709038784","display_name":null,"funder_award_id":"37507","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"},{"id":"https://openalex.org/G6507602547","display_name":null,"funder_award_id":"2018-2021 (8021-00249B)","funder_id":"https://openalex.org/F4320310485","funder_display_name":"Natur og Univers, Det Frie Forskningsr\u00e5d"}],"funders":[{"id":"https://openalex.org/F4320310485","display_name":"Natur og Univers, Det Frie Forskningsr\u00e5d","ror":"https://ror.org/03ge1nb22"},{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"},{"id":"https://openalex.org/F4320322928","display_name":"Danmarks Frie Forskningsfond","ror":"https://ror.org/02sptwz63"},{"id":"https://openalex.org/F4320323153","display_name":"Danmarks Tekniske Universitet","ror":"https://ror.org/04qtj9h94"},{"id":"https://openalex.org/F4320334966","display_name":"Bhabha Atomic Research Centre","ror":"https://ror.org/05w6wfp17"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4400090660.pdf"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W1572092079","https://openalex.org/W1655990431","https://openalex.org/W1676865579","https://openalex.org/W1786052730","https://openalex.org/W1963524245","https://openalex.org/W1968647828","https://openalex.org/W1974876810","https://openalex.org/W1986022261","https://openalex.org/W1991632262","https://openalex.org/W1992869351","https://openalex.org/W1993766956","https://openalex.org/W1997906261","https://openalex.org/W2009695707","https://openalex.org/W2010151376","https://openalex.org/W2026511056","https://openalex.org/W2038643780","https://openalex.org/W2044332144","https://openalex.org/W2045430818","https://openalex.org/W2048356005","https://openalex.org/W2061705660","https://openalex.org/W2064175146","https://openalex.org/W2066362074","https://openalex.org/W2075541196","https://openalex.org/W2089620427","https://openalex.org/W2089807138","https://openalex.org/W2094632707","https://openalex.org/W2104224360","https://openalex.org/W2106352538","https://openalex.org/W2118382442","https://openalex.org/W2120424341","https://openalex.org/W2121473031","https://openalex.org/W2166242192","https://openalex.org/W2762935521","https://openalex.org/W2777026024","https://openalex.org/W2964264613","https://openalex.org/W4232436772","https://openalex.org/W4238411931","https://openalex.org/W4251311582","https://openalex.org/W4300030091"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"present":[2],"a":[3,8,18,80],"data":[4,76],"structure":[5,77],"that,":[6],"given":[7],"graph":[9],"G":[10,26,29],"of":[11,21,25,48,106],"n":[12],"vertices":[13,71],"and":[14,17,44,101,111],"m":[15,53],"edges,":[16],"suitable":[19],"pair":[20],"nested":[22],"r":[23],"-divisions":[24],",":[27],"preprocesses":[28],"in":[30,50,63,84],"$$O(m+n)$$":[31],"<mml:math":[32],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[33],"<mml:mrow>":[34],"<mml:mi>O</mml:mi>":[35],"<mml:mo>(</mml:mo>":[36],"<mml:mi>m</mml:mi>":[37],"<mml:mo>+</mml:mo>":[38],"<mml:mi>n</mml:mi>":[39],"<mml:mo>)</mml:mo>":[40],"</mml:mrow>":[41],"</mml:math>":[42],"time":[43,56],"handles":[45],"any":[46],"series":[47],"edge-deletions":[49],"O":[51,65,86],"(":[52],")":[54],"total":[55],"while":[57],"answering":[58],"queries":[59],"to":[60],"pairwise":[61],"biconnectivity":[62],"worst-case":[64,85],"(1)":[66,87],"time.":[67,88],"In":[68],"case":[69],"the":[70,75],"are":[72],"not":[73],"biconnected,":[74],"can":[78],"return":[79],"cutvertex":[81],"separating":[82],"them":[83],"As":[89],"an":[90],"immediate":[91],"consequence,":[92],"this":[93],"gives":[94],"optimal":[95],"amortized":[96],"decremental":[97],"biconnectivity,":[98],"2-edge":[99],"connectivity,":[100],"connectivity":[102],"for":[103],"large":[104],"classes":[105],"graphs,":[107],"including":[108],"planar":[109],"graphs":[110],"other":[112],"minor":[113],"free":[114],"graphs.":[115]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}