{"id":"https://openalex.org/W1510484044","doi":"https://doi.org/10.1007/bfb0019790","title":"A distributed spanning tree algorithm","display_name":"A distributed spanning tree algorithm","publication_year":1988,"publication_date":"1988-01-01","ids":{"openalex":"https://openalex.org/W1510484044","doi":"https://doi.org/10.1007/bfb0019790","mag":"1510484044"},"language":"en","primary_location":{"id":"doi:10.1007/bfb0019790","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0019790","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5059909224","display_name":"Karl Erik Johansen","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Karl Erik Johansen","raw_affiliation_strings":["Computer Science Department, Aarhus University, DK-8000, Aarhus C, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Aarhus University, DK-8000, Aarhus C, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004353754","display_name":"Ulla Lundin J\u00f8rgensen","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Ulla Lundin J\u00f8rgensen","raw_affiliation_strings":["Computer Science Department, Aarhus University, DK-8000, Aarhus C, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Aarhus University, DK-8000, Aarhus C, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015064214","display_name":"Svend Hauge Nielsen","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Svend Hauge Nielsen","raw_affiliation_strings":["Computer Science Department, Aarhus University, DK-8000, Aarhus C, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Aarhus University, DK-8000, Aarhus C, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009017388","display_name":"S\u00f8ren Erik Nielsen","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"S\u00f8ren Erik Nielsen","raw_affiliation_strings":["Computer Science Department, Aarhus University, DK-8000, Aarhus C, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Aarhus University, DK-8000, Aarhus C, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017408163","display_name":"Sven Skyum","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Sven Skyum","raw_affiliation_strings":["Computer Science Department, Aarhus University, DK-8000, Aarhus C, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Aarhus University, DK-8000, Aarhus C, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.05964912,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"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.9991999864578247,"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.9991999864578247,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9943000078201294,"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/T11106","display_name":"Data Management and Algorithms","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.8073629140853882},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7796881794929504},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6841906905174255},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.6099040508270264},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5787937045097351},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5676976442337036},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.558107316493988},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.5094690918922424},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.45743754506111145},{"id":"https://openalex.org/keywords/identity","display_name":"Identity (music)","score":0.43777912855148315},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.4258924722671509},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4092678427696228},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38635480403900146},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37256094813346863},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3696081340312958},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1939893662929535},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.1754280924797058}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8073629140853882},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7796881794929504},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6841906905174255},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.6099040508270264},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5787937045097351},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5676976442337036},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.558107316493988},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.5094690918922424},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.45743754506111145},{"id":"https://openalex.org/C2778355321","wikidata":"https://www.wikidata.org/wiki/Q17079427","display_name":"Identity (music)","level":2,"score":0.43777912855148315},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.4258924722671509},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4092678427696228},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38635480403900146},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37256094813346863},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3696081340312958},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1939893662929535},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.1754280924797058},{"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":3,"locations":[{"id":"doi:10.1007/bfb0019790","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0019790","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:publications/26a6a2ab-ff48-4045-8f5d-170f3d75d0a3","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/26a6a2ab-ff48-4045-8f5d-170f3d75d0a3","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Johansen, K E, J\u00f8rgensen, U L, Nielsen, S H, Nielsen, S E & Skyum, S 1988, A distributed spanning tree algorithm. in J van Leeuwen (ed.), Distributed Algorithms : 2nd International Workshop Amsterdam, The Netherlands, July 8\u201310, 1987 Proceedings. Springer, Lecture Notes in Computer Science, vol. 312, pp. 1-12, 2nd International Workshop on Distributed Algorithms, Amsterdam, Netherlands, 08/07/1987. https://doi.org/10.1007/BFb0019790","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.atira.dk:publications/e266d624-48a2-42fd-94ec-77ed5e8681ee","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/e266d624-48a2-42fd-94ec-77ed5e8681ee","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Johansen, K E, J\u00f8rgensen, U L, Nielsen, S H, Nielsen, S E & Skyum, S 1987, A Distributed Spanning Tree Algorithm. Daimi Report Series (DAIMI PB), no. 226, Department of Computer Science, Aarhus University.","raw_type":"info:eu-repo/semantics/report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2077371116","https://openalex.org/W2087528263","https://openalex.org/W2091422787","https://openalex.org/W2096149703","https://openalex.org/W2099012404","https://openalex.org/W2128823163","https://openalex.org/W2296352387"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2387385213","https://openalex.org/W2381121915","https://openalex.org/W4242086819","https://openalex.org/W2589768050","https://openalex.org/W2074214908","https://openalex.org/W2390742649","https://openalex.org/W3016811403","https://openalex.org/W2353025557","https://openalex.org/W2943635264"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}