{"id":"https://openalex.org/W2972115413","doi":"https://doi.org/10.1145/3338529","title":"Fully Dynamic Graph Algorithms Inspired by Distributed Computing","display_name":"Fully Dynamic Graph Algorithms Inspired by Distributed Computing","publication_year":2019,"publication_date":"2019-09-05","ids":{"openalex":"https://openalex.org/W2972115413","doi":"https://doi.org/10.1145/3338529","mag":"2972115413"},"language":"en","primary_location":{"id":"doi:10.1145/3338529","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3338529","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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 Journal of Experimental Algorithmics","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/A5057471294","display_name":"Leonid Barenboim","orcid":"https://orcid.org/0000-0002-9021-3549"},"institutions":[{"id":"https://openalex.org/I164950643","display_name":"Open University of Israel","ror":"https://ror.org/027z64205","country_code":"IL","type":"education","lineage":["https://openalex.org/I164950643"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Leonid Barenboim","raw_affiliation_strings":["Open University of Israel, Raanana, Israel"],"affiliations":[{"raw_affiliation_string":"Open University of Israel, Raanana, Israel","institution_ids":["https://openalex.org/I164950643"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033078782","display_name":"Tzalik Maimon","orcid":null},"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":"Tzalik Maimon","raw_affiliation_strings":["Ben-Gurion University of the Negev, Beer-Sheva, Israel"],"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Beer-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5057471294"],"corresponding_institution_ids":["https://openalex.org/I164950643"],"apc_list":null,"apc_paid":null,"fwci":0.582,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.70282855,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"24","issue":null,"first_page":"1","last_page":"24"},"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.9998000264167786,"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.9998000264167786,"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.9973999857902527,"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/T10237","display_name":"Cryptography and Data Security","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/maximal-independent-set","display_name":"Maximal independent set","score":0.705746054649353},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.6738891005516052},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.619229793548584},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5529404878616333},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5435019731521606},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.5260500907897949},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4762161672115326},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.43660399317741394},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4363044500350952},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4225029945373535},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.41965609788894653},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.41622394323349},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.41374292969703674},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39412397146224976},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3600419759750366},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.342734158039093},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2973704934120178},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2958891689777374}],"concepts":[{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.705746054649353},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.6738891005516052},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.619229793548584},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5529404878616333},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5435019731521606},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5260500907897949},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4762161672115326},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.43660399317741394},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4363044500350952},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4225029945373535},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.41965609788894653},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.41622394323349},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.41374292969703674},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39412397146224976},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3600419759750366},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.342734158039093},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2973704934120178},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2958891689777374},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3338529","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3338529","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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 Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4699999988079071,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320317241","display_name":"Open University of Israel","ror":"https://ror.org/027z64205"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W107043336","https://openalex.org/W1892691276","https://openalex.org/W1983248819","https://openalex.org/W1987099434","https://openalex.org/W1992996565","https://openalex.org/W2007218972","https://openalex.org/W2009695707","https://openalex.org/W2009827511","https://openalex.org/W2011894656","https://openalex.org/W2054910423","https://openalex.org/W2102669784","https://openalex.org/W2121473031","https://openalex.org/W2133476289","https://openalex.org/W2136185479","https://openalex.org/W2146343385","https://openalex.org/W2163371823","https://openalex.org/W2241862190","https://openalex.org/W2341465683","https://openalex.org/W2736175998","https://openalex.org/W2911770460","https://openalex.org/W2915028621","https://openalex.org/W2963645943","https://openalex.org/W2964007887"],"related_works":["https://openalex.org/W2963009577","https://openalex.org/W2788975631","https://openalex.org/W2903402681","https://openalex.org/W3123958729","https://openalex.org/W2117608641","https://openalex.org/W2108370908","https://openalex.org/W1681620790","https://openalex.org/W4225961400","https://openalex.org/W2898526288","https://openalex.org/W4286287454"],"abstract_inverted_index":{"We":[0,387],"study":[1],"dynamic":[2,7,103,307],"graphs":[3,42,134,169,172,193,213,218,233,251,260],"in":[4,46,59,162,192,211,325,360,366,385],"the":[5,13,26,117,121,128,136,147,300,304,314,339,343,351,354,361,367],"fully":[6,306],"centralized":[8,305,327,362],"setting.":[9,308,328],"In":[10,176,231],"this":[11,60,99,177,181],"setting,":[12,363],"vertex":[14],"set":[15,28],"of":[16,19,88,98,158,160,217,228,257,299,338,393],"size":[17],"n":[18,143,163,200,204,270],"a":[20,64,67,89,102,109,224,291,322,326,335],"graph":[21],"G":[22],"is":[23,62,82,91,106,113,146,223,310,331,345,358,392],"fixed,":[24],"and":[25,54,152,170,206,245,319,348,376,396],"edge":[27,73],"changes":[29],"step-by-step,":[30],"such":[31,48,78],"that":[32,79,105,112,294,342,357,379,389],"each":[33,76,80,316],"step":[34,81,90],"either":[35],"adds":[36],"or":[37],"removes":[38],"an":[39],"edge.":[40],"Dynamic":[41],"have":[43],"various":[44,255,373],"applications":[45],"fields":[47],"as":[49,101],"Communication":[50],"Networks,":[51],"Computer":[52],"Graphics,":[53],"VLSI":[55],"Design.":[56],"The":[57,85,156,215,329],"goal":[58],"setting":[61,100,302],"maintaining":[63,116],"solution":[65,352],"to":[66,120,303,334,400],"certain":[68,296],"problem":[69],"(e.g.,":[70],"maximal":[71,150,190],"matching,":[72],"coloring)":[74],"after":[75],"step,":[77],"executed":[83],"efficiently.":[84],"running":[86],"time":[87],"called":[92],"update-time":[93,140,164,186,281],".":[94,214],"One":[95],"can":[96],"think":[97],"network":[104,340,374],"monitored":[107],"by":[108,183,312,349],"central":[110,126],"processor":[111,317],"responsible":[114],"for":[115,124,132,149,167,189,207,282],"solution.":[118],"Prior":[119],"current":[122],"work,":[123],"several":[125],"problems,":[127],"best-known":[129],"deterministic":[130,165,187],"algorithms":[131,166,188,276,298,381],"general":[133,171,212,283],"were":[135],"naive":[137],"ones":[138],"with":[139,194,219,234,261],"O":[141,154,209,274],"(":[142,199],").":[144],"This":[145,309],"case":[148],"matching":[151,191],"proper":[153,208],"(\u0394)-edge-coloring.":[155],"question":[157,182],"existence":[159],"sublinear":[161,185],"dense":[168,229],"remained":[173],"wide":[174,226],"open.":[175],"article,":[178],"we":[179,289],"address":[180],"devising":[184],"bounded":[195,220],"neighborhood":[196,221,236,263],"independence":[197,222,237],"o":[198],"/":[201],"log":[202],"2":[203],"),":[205],"(\u0394)-edge-coloring":[210,275],"family":[216,227],"very":[225,253],"graphs.":[230,248,284],"particular,":[232],"constant":[235,262],"include":[238],"line-graphs,":[239],"claw-free":[240],"graphs,":[241,244],"unit":[242],"disk":[243],"many":[246],"other":[247],"Thus,":[249],"these":[250],"represent":[252],"well":[254],"types":[256],"networks.":[258],"For":[259],"independence,":[264],"our":[265,287,380,390],"maximal-matching":[266],"algorithm":[267,324,344],"has":[268,277],"\u00d5(\u221a":[269,278],")":[271,280],"update-time.":[272],"Our":[273,370],"\u0394":[279],"To":[285],"obtain":[286],"results,":[288],"employ":[290],"novel":[292],"approach":[293,391],"adapts":[295],"distributed":[297,323,368],"LOCAL":[301],"achieved":[311],"optimizing":[313],"work":[315],"performs":[318],"efficiently":[320],"simulating":[321],"simulation":[330],"efficient,":[332],"thanks":[333],"careful":[336],"selection":[337],"parts":[341],"invoked":[346],"on,":[347],"deducing":[350],"from":[353],"additional":[355,401],"information":[356],"present":[359],"but":[364],"not":[365],"one.":[369],"experiments":[371],"on":[372],"topologies":[375],"scenarios":[377],"demonstrate":[378],"are":[382],"highly":[383],"efficient":[384],"practice.":[386],"believe":[388],"independent":[394],"interest":[395],"may":[397],"be":[398],"applicable":[399],"problems.":[402]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}