{"id":"https://openalex.org/W2088374619","doi":"https://doi.org/10.1137/0216019","title":"The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors","display_name":"The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors","publication_year":1987,"publication_date":"1987-04-01","ids":{"openalex":"https://openalex.org/W2088374619","doi":"https://doi.org/10.1137/0216019","mag":"2088374619"},"language":"en","primary_location":{"id":"doi:10.1137/0216019","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0216019","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5074054097","display_name":"Ephraim Korach","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":"E. Korach","raw_affiliation_strings":["Technion \u00ad Israel Institute of Technology, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion \u00ad Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007961513","display_name":"Shlomo Moran","orcid":"https://orcid.org/0000-0003-3222-3308"},"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":"S. Moran","raw_affiliation_strings":["Technion \u00ad Israel Institute of Technology, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion \u00ad Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009919512","display_name":"Shmuel Zaks","orcid":"https://orcid.org/0000-0001-5637-4923"},"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":"S. Zaks","raw_affiliation_strings":["Technion \u00ad Israel Institute of Technology, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion \u00ad Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.022,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.80518093,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"16","issue":"2","first_page":"231","last_page":"236"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","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/T10829","display_name":"Interconnection Networks and Systems","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/T10772","display_name":"Distributed systems and fault tolerance","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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7465608716011047},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7003912925720215},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.619785487651825},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6130005717277527},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.595443844795227},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5838891267776489},{"id":"https://openalex.org/keywords/distributive-property","display_name":"Distributive property","score":0.5732307434082031},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5459096431732178},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5221396088600159},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49200889468193054},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4779548645019531},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44625338912010193},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.42650774121284485},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.416536808013916},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.31362277269363403}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7465608716011047},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7003912925720215},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.619785487651825},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6130005717277527},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.595443844795227},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5838891267776489},{"id":"https://openalex.org/C11821877","wikidata":"https://www.wikidata.org/wiki/Q187959","display_name":"Distributive property","level":2,"score":0.5732307434082031},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5459096431732178},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5221396088600159},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49200889468193054},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4779548645019531},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44625338912010193},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.42650774121284485},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.416536808013916},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31362277269363403},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0216019","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0216019","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2077371116"],"related_works":["https://openalex.org/W3099328339","https://openalex.org/W2157421865","https://openalex.org/W2032442730","https://openalex.org/W2803918337","https://openalex.org/W2352525723","https://openalex.org/W2074417667","https://openalex.org/W4327524512","https://openalex.org/W2088374619","https://openalex.org/W2062226917","https://openalex.org/W2015819397"],"abstract_inverted_index":{"In":[0],"a":[1,11,15,57,81,163],"previous":[2],"paper":[3],"we":[4,51,75],"showed":[5],"that":[6,32,53,77],"the":[7,34,44,54,64,78,85,103,110,116,122,126,140,143,146,153],"distributive":[8],"construction":[9,48,55,79],"of":[10,18,46,56,80,118,139,142,169],"spanning":[12,35,60,82],"tree":[13,36,61,83],"in":[14,23,29,63,102,107,121],"complete":[16],"network":[17],"processors":[19],"can":[20],"be":[21],"done":[22],"$O(n\\log":[24],"n)$":[25,171],"messages.":[26,144],"We":[27],"show":[28,52,76],"this":[30],"work":[31],"if":[33],"is":[37,88],"required":[38],"to":[39,162],"satisfy":[40],"certain":[41],"properties,":[42],"then":[43,74],"complexity":[45],"its":[47],"increases:":[49],"First":[50],"minimum":[58],"weight":[59],"requires,":[62],"worst":[65,104,123],"case,":[66],"at":[67,89,94],"least":[68,95],"$\\Omega":[69,96],"(n^2":[70],")$":[71],"messages,":[72],"and":[73,133,136,166],"where":[84],"maximum":[86],"degree":[87],"most":[90],"k":[91],"may":[92],"require":[93],"({{n^2":[97],"}":[98],"/":[99],"k})$":[100],"messages":[101,168],"case.":[105,124],"Actually,":[106],"both":[108,131],"cases":[109],"lower":[111,159],"bounds":[112],"are":[113,128,137,150],"shown":[114],"for":[115,130,152],"number":[117],"edges":[119],"used":[120],"Moreover,":[125],"results":[127],"valid":[129],"asynchronous":[132],"synchronous":[134],"networks,":[135],"independent":[138],"lengths":[141],"On":[145],"other":[147],"hand,":[148],"there":[149],"algorithms":[151],"above":[154],"tasks":[155],"which":[156],"achieve":[157],"these":[158],"bounds,":[160],"up":[161],"constant":[164],"factor,":[165],"use":[167],"$O(\\log":[170],"length.":[172]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
