{"id":"https://openalex.org/W2244920958","doi":"https://doi.org/10.1145/2700206","title":"Simple Deterministic Algorithms for Fully Dynamic Maximal Matching","display_name":"Simple Deterministic Algorithms for Fully Dynamic Maximal Matching","publication_year":2015,"publication_date":"2015-11-16","ids":{"openalex":"https://openalex.org/W2244920958","doi":"https://doi.org/10.1145/2700206","mag":"2244920958"},"language":"en","primary_location":{"id":"doi:10.1145/2700206","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2700206","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5066182501","display_name":"Ofer Neiman","orcid":"https://orcid.org/0000-0003-4179-4364"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ofer Neiman","raw_affiliation_strings":["Ben-Gurion University of the Negev, Beer-Sheva, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Beer-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084685735","display_name":"Shay Solomon","orcid":"https://orcid.org/0000-0003-2254-5100"},"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":"Shay Solomon","raw_affiliation_strings":["Weizmann Institute of Science"],"raw_orcid":null,"affiliations":[{"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":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.5291,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.93334641,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"12","issue":"1","first_page":"1","last_page":"15"},"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.9994000196456909,"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.9994000196456909,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9940999746322632,"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.9908000230789185,"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/amortized-analysis","display_name":"Amortized analysis","score":0.8289000988006592},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.7167342901229858},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6174678206443787},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.596523106098175},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.553947389125824},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5515112280845642},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5395665764808655},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.49413278698921204},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.469329297542572},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4558294415473938},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.44367387890815735},{"id":"https://openalex.org/keywords/arboricity","display_name":"Arboricity","score":0.42693817615509033},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41609370708465576},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3398398160934448},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.31061863899230957},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.3063955008983612},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.2638956904411316}],"concepts":[{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.8289000988006592},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.7167342901229858},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6174678206443787},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.596523106098175},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.553947389125824},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5515112280845642},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5395665764808655},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.49413278698921204},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.469329297542572},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4558294415473938},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.44367387890815735},{"id":"https://openalex.org/C83204008","wikidata":"https://www.wikidata.org/wiki/Q4784907","display_name":"Arboricity","level":4,"score":0.42693817615509033},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41609370708465576},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3398398160934448},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31061863899230957},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3063955008983612},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.2638956904411316},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2700206","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2700206","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1524840666","https://openalex.org/W1582032289","https://openalex.org/W1655990431","https://openalex.org/W1969485351","https://openalex.org/W1982440947","https://openalex.org/W1992869351","https://openalex.org/W2003813631","https://openalex.org/W2009695707","https://openalex.org/W2010042187","https://openalex.org/W2031592993","https://openalex.org/W2045430818","https://openalex.org/W2094619585","https://openalex.org/W2096413587","https://openalex.org/W2146343385","https://openalex.org/W2149710566","https://openalex.org/W2157529519","https://openalex.org/W2168920762","https://openalex.org/W2611854190","https://openalex.org/W3139713485"],"related_works":["https://openalex.org/W2467514673","https://openalex.org/W4388032032","https://openalex.org/W172647603","https://openalex.org/W2900862090","https://openalex.org/W2784019526","https://openalex.org/W4318350839","https://openalex.org/W2962965324","https://openalex.org/W2748289508","https://openalex.org/W2950929663","https://openalex.org/W2065826935"],"abstract_inverted_index":{"A":[0],"maximal":[1,199,240],"matching":[2,135,200,241],"can":[3],"be":[4],"maintained":[5],"in":[6,55,65,128,242],"fully":[7,100,141,197],"dynamic":[8,101,142,198],"(supporting":[9],"both":[10],"addition":[11],"and":[12,62,169,178,221,249],"deletion":[13],"of":[14,29,76,90,116,205,219],"edges)":[15],"n":[16,32,43,79,156,208,211,254],"-vertex":[17],"graphs":[18,174,177,179,237],"using":[19],"a":[20,25,68,111,125,131,196,227,239],"trivial":[21,106],"deterministic":[22,35,69,99,112,187,228],"algorithm":[23,36,70,102,123,143,188,229],"with":[24,71,189,201,230],"worst-case":[26,113],"update":[27,74,114,191,203],"time":[28,75,115,167,204,248],"O":[30,41,77,117,154,206,244,252],"(":[31,42,155,253],").":[33,120,212],"No":[34],"that":[37,103,139],"outperforms":[38,104],"the":[39,88,97,105,152],"na\u00efve":[40,153],")":[44,82,157,247,257],"one":[45],"was":[46,158],"reported":[47],"up":[48],"to":[49,60,161],"this":[50,56,93,162],"date.":[51],"The":[52],"only":[53,251],"progress":[54],"direction":[57],"is":[58,87,130],"due":[59],"Ivkovi\u0107":[61],"Lloyd,":[63],"who":[64],"1993":[66],"devised":[67],"an":[72,216],"amortized":[73,166,202,243],"((":[78],"+":[80,255],"m":[81,86,119,246,256],"\u221a2/2":[83],"),":[84],"where":[85],"number":[89],"edges.":[91],"In":[92],"article,":[94],"we":[95,109,183],"show":[96,226],"first":[98],"one.":[107],"Specifically,":[108,193],"provide":[110],"(\u221a":[118,245],"Moreover,":[121],"our":[122],"maintains":[124,195,238],"matching,":[126],"which":[127,234],"fact":[129],"3/2-approximate":[132],"maximum":[133],"cardinality":[134],"(MCM).":[136],"We":[137,224],"remark":[138],"no":[140],"for":[144,235],"maintaining":[145],"(2":[146],"\u2212":[147],"\u03f5)-approximate":[148],"MCM":[149],"improving":[150],"upon":[151],"known":[159],"prior":[160],"work,":[163],"even":[164],"allowing":[165],"bounds":[168],"randomization.":[170],"For":[171],"low":[172],"arboricity":[173],"(e.g.,":[175],"planar":[176],"excluding":[180],"fixed":[181],"minors),":[182],"devise":[184],"another":[185],"simple":[186],"sublogarithmic":[190],"time.":[192],"it":[194],"(log":[207],"/log":[209],"log":[210],"This":[213],"result":[214],"addresses":[215],"open":[217],"question":[218],"Onak":[220],"Rubinfeld":[222],"[2010].":[223],"also":[225],"optimal":[231],"space":[232],"usage,":[233],"arbitrary":[236],"uses":[250],"space.":[258]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}