{"id":"https://openalex.org/W2128823163","doi":"https://doi.org/10.1109/tcom.1983.1095883","title":"A Distributed Algorithm for Minimum Weight Directed Spanning Trees","display_name":"A Distributed Algorithm for Minimum Weight Directed Spanning Trees","publication_year":1983,"publication_date":"1983-06-01","ids":{"openalex":"https://openalex.org/W2128823163","doi":"https://doi.org/10.1109/tcom.1983.1095883","mag":"2128823163"},"language":"en","primary_location":{"id":"doi:10.1109/tcom.1983.1095883","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcom.1983.1095883","pdf_url":null,"source":{"id":"https://openalex.org/S4210170832","display_name":"IRE Transactions on Communications Systems","issn_l":"0096-2244","issn":["0096-2244","2162-2132"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","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/A5038437382","display_name":"P.A. Humblet","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"P. Humblet","raw_affiliation_strings":["Department of Engineering and Computer Science and the Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA","MIT, Cambridge MA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Engineering and Computer Science and the Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"MIT, Cambridge MA, USA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5038437382"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":2.3718,"has_fulltext":false,"cited_by_count":98,"citation_normalized_percentile":{"value":0.90233379,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"31","issue":"6","first_page":"756","last_page":"762"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9958999752998352,"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":0.9958999752998352,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9951000213623047,"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.9904999732971191,"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/spanning-tree","display_name":"Spanning tree","score":0.7450678944587708},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.6946450471878052},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6483019590377808},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6297059059143066},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5781679153442383},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5537751317024231},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5483435392379761},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.5477131009101868},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.5441440939903259},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49945950508117676},{"id":"https://openalex.org/keywords/root","display_name":"Root (linguistics)","score":0.4796457886695862},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.41490763425827026},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40253502130508423},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3592280447483063},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3473797142505646},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33995944261550903},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.12632343173027039},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08631503582000732}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7450678944587708},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.6946450471878052},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6483019590377808},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6297059059143066},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5781679153442383},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5537751317024231},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5483435392379761},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.5477131009101868},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.5441440939903259},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49945950508117676},{"id":"https://openalex.org/C171078966","wikidata":"https://www.wikidata.org/wiki/Q111029","display_name":"Root (linguistics)","level":2,"score":0.4796457886695862},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.41490763425827026},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40253502130508423},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3592280447483063},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3473797142505646},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33995944261550903},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.12632343173027039},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08631503582000732},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"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.1109/tcom.1983.1095883","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcom.1983.1095883","pdf_url":null,"source":{"id":"https://openalex.org/S4210170832","display_name":"IRE Transactions on Communications Systems","issn_l":"0096-2244","issn":["0096-2244","2162-2132"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","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":12,"referenced_works":["https://openalex.org/W1504262590","https://openalex.org/W1532690141","https://openalex.org/W1988615825","https://openalex.org/W2034441788","https://openalex.org/W2077371116","https://openalex.org/W2087304736","https://openalex.org/W2096279854","https://openalex.org/W2096389124","https://openalex.org/W2125690626","https://openalex.org/W2796429899","https://openalex.org/W4246185962","https://openalex.org/W6631915618"],"related_works":["https://openalex.org/W2146569528","https://openalex.org/W1998712144","https://openalex.org/W4287028074","https://openalex.org/W2106828717","https://openalex.org/W3191289342","https://openalex.org/W4300165677","https://openalex.org/W4297817344","https://openalex.org/W4292730466","https://openalex.org/W4255598955","https://openalex.org/W2603633312"],"abstract_inverted_index":{"A":[0,25],"distributed":[1],"algorithm":[2,47],"is":[3],"presented":[4],"for":[5],"constructing":[6],"minimum":[7],"weight":[8],"directed":[9,23],"spanning":[10],"trees":[11],"(arborescences),":[12],"each":[13,29],"with":[14,51],"a":[15,20],"distinct":[16],"root":[17],"node,":[18],"in":[19],"strongly":[21],"connected":[22],"graph.":[24],"processor":[26],"exists":[27],"at":[28],"node.":[30],"Given":[31],"the":[32,37,43,46,65],"weights":[33],"and":[34,48,64],"origins":[35],"of":[36,61],"edges":[38],"incoming":[39],"to":[40,67],"their":[41,52],"nodes,":[42],"processors":[44],"follow":[45],"exchange":[49],"messages":[50],"neighbors":[53],"until":[54],"all":[55],"arborescences":[56],"are":[57,69],"constructed.":[58],"The":[59],"amount":[60],"information":[62],"exchanged":[63],"time":[66],"completion":[68],"<tex":[70],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[71],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">O(|N|^{2})</tex>":[72],".":[73]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}