{"id":"https://openalex.org/W2000695296","doi":"https://doi.org/10.1007/s00446-004-0107-2","title":"A linear-time optimal-message distributed algorithm for minimum spanning trees","display_name":"A linear-time optimal-message distributed algorithm for minimum spanning trees","publication_year":2004,"publication_date":"2004-07-19","ids":{"openalex":"https://openalex.org/W2000695296","doi":"https://doi.org/10.1007/s00446-004-0107-2","mag":"2000695296"},"language":"en","primary_location":{"id":"doi:10.1007/s00446-004-0107-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00446-004-0107-2","pdf_url":null,"source":{"id":"https://openalex.org/S139349430","display_name":"Distributed Computing","issn_l":"0178-2770","issn":["0178-2770","1432-0452"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Distributed 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/A5018876909","display_name":"Michalis Faloutsos","orcid":"https://orcid.org/0000-0002-3882-9987"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michalis Faloutsos","raw_affiliation_strings":["Department of Computer Science, University of California Riverside, CA 92521, Riverside, USA","University of California Riverside, Department of Computer Science, Riverside, CA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California Riverside, CA 92521, Riverside, USA","institution_ids":["https://openalex.org/I103635307"]},{"raw_affiliation_string":"University of California Riverside, Department of Computer Science, Riverside, CA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5105468058","display_name":"Mart Molle","orcid":null},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mart Molle","raw_affiliation_strings":["Department of Computer Science, University of California Riverside, CA 92521, Riverside, USA","University of California Riverside, Department of Computer Science, Riverside, CA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California Riverside, CA 92521, Riverside, USA","institution_ids":["https://openalex.org/I103635307"]},{"raw_affiliation_string":"University of California Riverside, Department of Computer Science, Riverside, CA","institution_ids":["https://openalex.org/I103635307"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018876909"],"corresponding_institution_ids":["https://openalex.org/I103635307"],"apc_list":{"value":2490,"currency":"EUR","value_usd":3090},"apc_paid":null,"fwci":0.2522,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.64978602,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"17","issue":"2","first_page":null,"last_page":null},"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.9998000264167786,"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.9998000264167786,"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.9983999729156494,"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.9948999881744385,"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.8308532238006592},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7386524677276611},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7306751012802124},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7119015455245972},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6970590353012085},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.6056814789772034},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5894442796707153},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5216696262359619},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.520933985710144},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.46308284997940063},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.46175193786621094},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45306286215782166},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36334219574928284},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.24990317225456238},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23457130789756775},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.06283769011497498}],"concepts":[{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.8308532238006592},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7386524677276611},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7306751012802124},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7119015455245972},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6970590353012085},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.6056814789772034},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5894442796707153},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5216696262359619},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.520933985710144},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.46308284997940063},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.46175193786621094},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45306286215782166},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36334219574928284},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.24990317225456238},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23457130789756775},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06283769011497498}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00446-004-0107-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00446-004-0107-2","pdf_url":null,"source":{"id":"https://openalex.org/S139349430","display_name":"Distributed Computing","issn_l":"0178-2770","issn":["0178-2770","1432-0452"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Distributed 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":10,"referenced_works":["https://openalex.org/W1991541026","https://openalex.org/W2005900781","https://openalex.org/W2053783303","https://openalex.org/W2053788000","https://openalex.org/W2053981136","https://openalex.org/W2077371116","https://openalex.org/W2100466311","https://openalex.org/W2135333267","https://openalex.org/W2145492278","https://openalex.org/W2611515161"],"related_works":["https://openalex.org/W3011323517","https://openalex.org/W4380840098","https://openalex.org/W2899787781","https://openalex.org/W4242086819","https://openalex.org/W2387385213","https://openalex.org/W2074214908","https://openalex.org/W2589768050","https://openalex.org/W2381121915","https://openalex.org/W2898459690","https://openalex.org/W2371157450"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}