{"id":"https://openalex.org/W2087528263","doi":"https://doi.org/10.1016/0020-0190(86)90043-8","title":"A fully distributed (minimal) spanning tree algorithm","display_name":"A fully distributed (minimal) spanning tree algorithm","publication_year":1986,"publication_date":"1986-08-01","ids":{"openalex":"https://openalex.org/W2087528263","doi":"https://doi.org/10.1016/0020-0190(86)90043-8","mag":"2087528263"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(86)90043-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(86)90043-8","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5067081605","display_name":"Ivan Lavall\u00e9e","orcid":null},"institutions":[{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Ivan Lavallee","raw_affiliation_strings":["L.R.I., Universit\u00e9 Paris-Sud, B\u00e2timent 490, 91405 Orsay Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"L.R.I., Universit\u00e9 Paris-Sud, B\u00e2timent 490, 91405 Orsay Cedex, France","institution_ids":["https://openalex.org/I102197404"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036090357","display_name":"G\u00e9rard Roucairol","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G\u00e9rard Roucairol","raw_affiliation_strings":["Compagnie des Machines Bull, 64 route de Louveciennes DRTG/DRAL, 78430 Louveciennes, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Compagnie des Machines Bull, 64 route de Louveciennes DRTG/DRAL, 78430 Louveciennes, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":3.2903,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.92241379,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"23","issue":"2","first_page":"55","last_page":"62"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10575","display_name":"Wireless Communication Networks Research","score":0.9918000102043152,"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/T10575","display_name":"Wireless Communication Networks Research","score":0.9918000102043152,"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.991599977016449,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9860000014305115,"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/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.9142528772354126},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8126055002212524},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7835108041763306},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.7228320837020874},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6722818613052368},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.658185601234436},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.6564133167266846},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5241832137107849},{"id":"https://openalex.org/keywords/cognitive-radio","display_name":"Cognitive radio","score":0.5178968906402588},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.49785423278808594},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48250889778137207},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4746435582637787},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.4608328938484192},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.4455043375492096},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.44284239411354065},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42839452624320984},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4194563627243042},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3955621123313904},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.28793302178382874},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25404587388038635},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.15457919239997864},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1204347312450409},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.08331599831581116}],"concepts":[{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.9142528772354126},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8126055002212524},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7835108041763306},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.7228320837020874},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6722818613052368},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.658185601234436},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.6564133167266846},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5241832137107849},{"id":"https://openalex.org/C149946192","wikidata":"https://www.wikidata.org/wiki/Q3235733","display_name":"Cognitive radio","level":3,"score":0.5178968906402588},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.49785423278808594},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48250889778137207},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4746435582637787},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.4608328938484192},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.4455043375492096},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.44284239411354065},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42839452624320984},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4194563627243042},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3955621123313904},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.28793302178382874},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25404587388038635},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.15457919239997864},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1204347312450409},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.08331599831581116},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0020-0190(86)90043-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(86)90043-8","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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":8,"referenced_works":["https://openalex.org/W1482143660","https://openalex.org/W1495142994","https://openalex.org/W1964472792","https://openalex.org/W2012667106","https://openalex.org/W2077371116","https://openalex.org/W2087304736","https://openalex.org/W2296352387","https://openalex.org/W6629639331"],"related_works":["https://openalex.org/W2387385213","https://openalex.org/W4380840098","https://openalex.org/W3016811403","https://openalex.org/W2099915933","https://openalex.org/W2589768050","https://openalex.org/W2087528263","https://openalex.org/W2418231958","https://openalex.org/W2943635264","https://openalex.org/W2010585027","https://openalex.org/W2043113141"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}