{"id":"https://openalex.org/W4320853886","doi":"https://doi.org/10.48550/arxiv.2302.05951","title":"Fully Dynamic Exact Edge Connectivity in Sublinear Time","display_name":"Fully Dynamic Exact Edge Connectivity in Sublinear Time","publication_year":2023,"publication_date":"2023-02-12","ids":{"openalex":"https://openalex.org/W4320853886","doi":"https://doi.org/10.48550/arxiv.2302.05951"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2302.05951","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2302.05951","pdf_url":"https://arxiv.org/pdf/2302.05951","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"","raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2302.05951","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078315645","display_name":"Gramoz Goranci","orcid":"https://orcid.org/0000-0002-9603-2255"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Goranci, Gramoz","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003641345","display_name":"Monika Henzinger","orcid":"https://orcid.org/0000-0002-5008-6530"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Henzinger, Monika","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074369690","display_name":"Danupon Nanongkai","orcid":"https://orcid.org/0000-0003-4468-2675"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nanongkai, Danupon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010547647","display_name":"Thatchaphol Saranurak","orcid":"https://orcid.org/0000-0001-8386-7168"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saranurak, Thatchaphol","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039232562","display_name":"Mikkel Thorup","orcid":"https://orcid.org/0000-0001-5237-1709"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thorup, Mikkel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5077977985","display_name":"Christian Wulff\u2010Nilsen","orcid":"https://orcid.org/0000-0002-3699-7821"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wulff-Nilsen, Christian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5078315645"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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.9991999864578247,"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.9957000017166138,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9939000010490417,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.708238959312439},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.6790961623191833},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6480538249015808},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5984659790992737},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5567705035209656},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5300383567810059},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44726812839508057},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43979835510253906},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4298965334892273},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42061516642570496},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.419899046421051},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35548073053359985},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.08237287402153015}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.708238959312439},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.6790961623191833},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6480538249015808},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5984659790992737},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5567705035209656},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5300383567810059},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44726812839508057},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43979835510253906},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4298965334892273},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42061516642570496},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.419899046421051},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35548073053359985},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08237287402153015},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2302.05951","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2302.05951","pdf_url":"https://arxiv.org/pdf/2302.05951","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"","raw_type":"text"},{"id":"doi:10.48550/arxiv.2302.05951","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2302.05951","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2302.05951","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2302.05951","pdf_url":"https://arxiv.org/pdf/2302.05951","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1778706870","display_name":"Fast Algorithms for a Reactive Network Layer","funder_award_id":"P 33775","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G1836977259","display_name":"Distributed and Dynamic Graph Algorithms and Complexity","funder_award_id":"715672","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G1890725643","display_name":null,"funder_award_id":"2019-05622","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"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/G7498676008","display_name":null,"funder_award_id":"P 33775-N","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G7842005466","display_name":null,"funder_award_id":"Horizon 2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8917786452","display_name":"The design and evaluation of modern fully dynamic data structures","funder_award_id":"101019564","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320321652","display_name":"Eidgen\u00f6ssische Technische Hochschule Z\u00fcrich","ror":"https://ror.org/05a28rw58"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"},{"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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4320853886.pdf","grobid_xml":"https://content.openalex.org/works/W4320853886.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W90906771","https://openalex.org/W2018828772","https://openalex.org/W2529185025","https://openalex.org/W2052708136","https://openalex.org/W2809723425","https://openalex.org/W2005302727","https://openalex.org/W4289097813","https://openalex.org/W3082028334","https://openalex.org/W4308171630","https://openalex.org/W4205594610"],"abstract_inverted_index":{"Given":[0],"a":[1],"simple":[2],"$n$-vertex,":[3],"$m$-edge":[4],"graph":[5],"$G$":[6,26],"undergoing":[7],"edge":[8,23,44,50,59],"insertions":[9,60],"and":[10,32],"deletions,":[11],"we":[12],"give":[13],"two":[14],"new":[15],"fully":[16],"dynamic":[17,43],"algorithms":[18,46],"for":[19],"exactly":[20],"maintaining":[21],"the":[22],"connectivity":[24,45],"of":[25],"in":[27],"$\\tilde{O}(n)$":[28],"worst-case":[29],"update":[30,35],"time":[31],"$\\tilde{O}(m^{1-1/31})$":[33],"amortized":[34],"time,":[36],"respectively.":[37],"Prior":[38],"to":[39,58,68],"our":[40],"work,":[41],"all":[42],"either":[47],"assumed":[48],"bounded":[49],"connectivity,":[51],"guaranteed":[52],"approximate":[53],"solutions,":[54],"or":[55],"were":[56],"restricted":[57],"only.":[61],"Our":[62],"results":[63],"provide":[64],"an":[65,69],"affirmative":[66],"answer":[67],"open":[70],"question":[71],"posed":[72],"by":[73],"Thorup":[74],"[Combinatorica'07].":[75]},"counts_by_year":[],"updated_date":"2026-05-15T08:27:34.491423","created_date":"2025-10-10T00:00:00"}