{"id":"https://openalex.org/W2003024612","doi":"https://doi.org/10.1145/1391289.1391292","title":"Optimal maintenance of a spanning tree","display_name":"Optimal maintenance of a spanning tree","publication_year":2008,"publication_date":"2008-09-01","ids":{"openalex":"https://openalex.org/W2003024612","doi":"https://doi.org/10.1145/1391289.1391292","mag":"2003024612"},"language":"en","primary_location":{"id":"doi:10.1145/1391289.1391292","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1391289.1391292","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","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/A5110260801","display_name":"Baruch Awerbuch","orcid":null},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Baruch Awerbuch","raw_affiliation_strings":["Johns Hopkins University, Baltimore, Maryland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Johns Hopkins University, Baltimore, Maryland","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033041657","display_name":"Israel Cidon","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Israel Cidon","raw_affiliation_strings":["Technion, Haifa, Israel","Technion , Haifa , Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Technion , Haifa , Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033442948","display_name":"Shay Kutten","orcid":"https://orcid.org/0000-0003-2062-6855"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Shay Kutten","raw_affiliation_strings":["Technion, Haifa, Israel","Technion , Haifa , Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Technion , Haifa , Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5110260801"],"corresponding_institution_ids":["https://openalex.org/I145311948"],"apc_list":null,"apc_paid":null,"fwci":1.1436,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.80698467,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"55","issue":"4","first_page":"1","last_page":"45"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":1.0,"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/T12288","display_name":"Optimization and Search Problems","score":0.9993000030517578,"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.9980999827384949,"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/computer-science","display_name":"Computer science","score":0.7447839975357056},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6416645050048828},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6252097487449646},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.6136813759803772},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5708082318305969},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5338987112045288},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.5129086971282959},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4762554168701172},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4607902467250824},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4491916000843048},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4205763638019562},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.4175836443901062},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4140335023403168},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.39321208000183105},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2745523452758789},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1955375373363495},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.13630026578903198},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11498028039932251}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7447839975357056},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6416645050048828},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6252097487449646},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.6136813759803772},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5708082318305969},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5338987112045288},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.5129086971282959},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4762554168701172},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4607902467250824},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4491916000843048},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4205763638019562},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.4175836443901062},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4140335023403168},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.39321208000183105},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2745523452758789},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1955375373363495},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.13630026578903198},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11498028039932251},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1391289.1391292","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1391289.1391292","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","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":73,"referenced_works":["https://openalex.org/W111570186","https://openalex.org/W1145097660","https://openalex.org/W1481761413","https://openalex.org/W1518121951","https://openalex.org/W1523219502","https://openalex.org/W1549658930","https://openalex.org/W1564616765","https://openalex.org/W1585716122","https://openalex.org/W1746810856","https://openalex.org/W1901784050","https://openalex.org/W1963834353","https://openalex.org/W1966441918","https://openalex.org/W1969057198","https://openalex.org/W1976485065","https://openalex.org/W1977502354","https://openalex.org/W1984247996","https://openalex.org/W1986507065","https://openalex.org/W1987231545","https://openalex.org/W1989139142","https://openalex.org/W1997996213","https://openalex.org/W1999812311","https://openalex.org/W2004744736","https://openalex.org/W2010515997","https://openalex.org/W2011578798","https://openalex.org/W2012456804","https://openalex.org/W2013173096","https://openalex.org/W2017670690","https://openalex.org/W2018798310","https://openalex.org/W2020527736","https://openalex.org/W2024870556","https://openalex.org/W2026402358","https://openalex.org/W2029936518","https://openalex.org/W2035360197","https://openalex.org/W2035362408","https://openalex.org/W2049596277","https://openalex.org/W2051440630","https://openalex.org/W2052504823","https://openalex.org/W2060367456","https://openalex.org/W2067186100","https://openalex.org/W2069009452","https://openalex.org/W2076590364","https://openalex.org/W2077059864","https://openalex.org/W2077371116","https://openalex.org/W2087686737","https://openalex.org/W2088595192","https://openalex.org/W2091422818","https://openalex.org/W2092534058","https://openalex.org/W2094895595","https://openalex.org/W2095640656","https://openalex.org/W2097067636","https://openalex.org/W2102615478","https://openalex.org/W2107238520","https://openalex.org/W2113495627","https://openalex.org/W2121473031","https://openalex.org/W2131053137","https://openalex.org/W2133323743","https://openalex.org/W2135985056","https://openalex.org/W2138760535","https://openalex.org/W2150519657","https://openalex.org/W2151903999","https://openalex.org/W2152299433","https://openalex.org/W2153349112","https://openalex.org/W2164436311","https://openalex.org/W2165681304","https://openalex.org/W2168930695","https://openalex.org/W2295747887","https://openalex.org/W2340365916","https://openalex.org/W2561675875","https://openalex.org/W2657967087","https://openalex.org/W2773863946","https://openalex.org/W3157736721","https://openalex.org/W4230500858","https://openalex.org/W4245204605"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2381121915","https://openalex.org/W2376814941","https://openalex.org/W2387385213","https://openalex.org/W2390742649","https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W2562218965","https://openalex.org/W2137031274","https://openalex.org/W2087528263"],"abstract_inverted_index":{"In":[0],"this":[1],"article,":[2],"we":[3],"show":[4],"that":[5,93,195],"keeping":[6],"track":[7],"of":[8,17,27,40,55,76,80,110,129,139,155,162,209],"history":[9],"enables":[10],"significant":[11],"improvements":[12],"in":[13,31,57,120,183,186],"the":[14,38,53,58,65,74,77,81,111,160,184,193,202],"communication":[15,24],"complexity":[16,44],"dynamic":[18,33,96,143],"network":[19,133],"protocols.":[20],"We":[21],"present":[22,190],"a":[23,28,32,156,172],"optimal":[25],"maintenance":[26,154],"spanning":[29,157],"tree":[30,112,158],"network.":[34,59],"The":[35,60],"amortized":[36],"(on":[37],"number":[39,54],"topological":[41,105],"changes)":[42],"message":[43,61],"is":[45,52,67,73,207],"O":[46,68,87],"(":[47,100],"V":[48,51,89],"),":[49],"where":[50,71],"nodes":[56],"size":[62,75],"used":[63],"by":[64,201],"algorithm":[66],"(log":[69,88],"|ID|)":[70],"|ID|":[72,85],"name":[78],"space":[79],"nodes.":[82],"Typically,":[83],"log":[84],"=":[86],").":[90],"Previous":[91],"algorithms":[92,141,163],"adapt":[94],"to":[95,131,142,175,188],"networks":[97],"involved":[98],"\u03a9":[99],"E":[101],")":[102],"messages":[103,130,197],"per":[104],"change\u2014inherently":[106],"paying":[107],"for":[108,164],"re-computation":[109],"from":[113,192],"scratch.":[114],"Spanning":[115],"trees":[116],"are":[117,169],"essential":[118],"components":[119],"many":[121],"distributed":[122],"algorithms.":[123],"Some":[124],"examples":[125],"include":[126],"broadcast":[127],"(dissemination":[128],"all":[132],"nodes),":[134],"multicast,":[135],"reset":[136],"(general":[137],"adaptation":[138],"static":[140],"networks),":[144],"routing,":[145],"termination":[146],"detection":[147],",":[148],"and":[149],"more.":[150],"Thus,":[151],"our":[152,210],"efficient":[153],"implies":[159],"improvement":[161],"these":[165],"tasks.":[166],"Our":[167],"results":[168],"obtained":[170],"using":[171],"novel":[173],"technique":[174,206],"save":[176],"communication.":[177],"A":[178],"node":[179],"uses":[180],"information":[181,191],"received":[182],"past":[185],"order":[187],"deduce":[189],"fact":[194],"certain":[196],"were":[198],"NOT":[199],"sent":[200],"node's":[203],"neighbor.":[204],"This":[205],"one":[208],"main":[211],"contributions.":[212]},"counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}