{"id":"https://openalex.org/W7118607664","doi":"https://doi.org/10.1137/1.9781611978964.31","title":"Simple Algorithms for Fully Dynamic Edge Connectivity","display_name":"Simple Algorithms for Fully Dynamic Edge Connectivity","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7118607664","doi":"https://doi.org/10.1137/1.9781611978964.31"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611978964.31","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978964.31","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 SIAM Symposium on Simplicity in Algorithms (SOSA)","raw_type":"book-chapter"},"type":"book-chapter","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/A5119918554","display_name":"Yotam Kenneth-Mordoch","orcid":null},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Yotam Kenneth-Mordoch","raw_affiliation_strings":["Weizmann Institute of Science"],"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037378898","display_name":"Robert Krauthgamer","orcid":"https://orcid.org/0009-0003-8154-3735"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Robert Krauthgamer","raw_affiliation_strings":["The Harry Weinrebe Professorial Chair of Computer Science. Work partially supported by the Israel Science Foundation grant #1336/23, by the Israeli Council for Higher Education (CHE) via the Weizmann Data Science Research Center, and by a research grant from the Estate of Harry Schutzman","Weizmann Institute of Science"],"affiliations":[{"raw_affiliation_string":"The Harry Weinrebe Professorial Chair of Computer Science. Work partially supported by the Israel Science Foundation grant #1336/23, by the Israeli Council for Higher Education (CHE) via the Weizmann Data Science Research Center, and by a research grant from the Estate of Harry Schutzman","institution_ids":[]},{"raw_affiliation_string":"Weizmann Institute of Science","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5119918554"],"corresponding_institution_ids":["https://openalex.org/I53964585"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27684964,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"394","last_page":"403"},"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.9115999937057495,"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.9115999937057495,"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.01640000008046627,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.011800000444054604,"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/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.6503000259399414},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6176999807357788},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4943000078201294},{"id":"https://openalex.org/keywords/simple-algorithm","display_name":"SIMPLE algorithm","score":0.4323999881744385},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4165000021457672},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.38190001249313354},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.3549000024795532},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3278000056743622}],"concepts":[{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.6503000259399414},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6485000252723694},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6176999807357788},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5347999930381775},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4943000078201294},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.4323999881744385},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4165000021457672},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.38190001249313354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38019999861717224},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3549000024795532},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3278000056743622},{"id":"https://openalex.org/C2993105083","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Simple graph","level":3,"score":0.29589998722076416},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.2856000065803528},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2854999899864197},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.27810001373291016},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.27730000019073486},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.27309998869895935},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.27219998836517334},{"id":"https://openalex.org/C204562854","wikidata":"https://www.wikidata.org/wiki/Q1397646","display_name":"Edge contraction","level":5,"score":0.2676999866962433},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.26100000739097595},{"id":"https://openalex.org/C193536780","wikidata":"https://www.wikidata.org/wiki/Q1513153","display_name":"Edge detection","level":4,"score":0.25870001316070557},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.2572000026702881}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611978964.31","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978964.31","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 SIAM Symposium on Simplicity in Algorithms (SOSA)","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"the":[1,7,20,43,56,82],"fully":[2],"dynamic":[3],"edge":[4,15,26,44,53,94],"connectivity":[5,45],"problem,":[6],"input":[8],"is":[9,22,81],"a":[10],"simple":[11,33],"graph":[12],"\\(G\\)":[13],"undergoing":[14],"insertions":[16],"and":[17,19,73,88],"deletions,":[18],"goal":[21],"to":[23],"maintain":[24],"its":[25],"connectivity,":[27,95],"denoted":[28],"\\(\\lambda_G\\).":[29],"We":[30],"present":[31],"two":[32],"randomized":[34],"algorithms":[35],"solving":[36],"this":[37],"problem.":[38],"The":[39],"first":[40,83],"algorithm":[41,65,84],"maintains":[42],"in":[46],"worst-case":[47,67,74,86],"update":[48,68,87],"time":[49,69,76,90],"\\(\\tilde":[50,70,77],"O(n)\\)":[51],"per":[52],"update,":[54],"matching":[55],"known":[57],"bound":[58],"but":[59],"with":[60,85],"simpler":[61],"analysis.":[62],"Our":[63],"second":[64],"achieves":[66],"O(n/\\lambda_G":[71],")\\)":[72],"query":[75,89],"O(n^2/\\lambda^2_G":[78],")\\),":[79],"which":[80],"\\(o(n)\\)":[91],"for":[92],"large":[93],"namely,":[96],"\\(\\lambda_G":[97],"=":[98],"\\omega(\\sqrt":[99],"n":[100],")\\).":[101]},"counts_by_year":[],"updated_date":"2026-01-08T20:10:11.968330","created_date":"2026-01-08T00:00:00"}