{"id":"https://openalex.org/W1593663058","doi":"https://doi.org/10.1007/bfb0028279","title":"An empirical analysis of algorithms for constructing a minimum spanning tree","display_name":"An empirical analysis of algorithms for constructing a minimum spanning tree","publication_year":2005,"publication_date":"2005-11-22","ids":{"openalex":"https://openalex.org/W1593663058","doi":"https://doi.org/10.1007/bfb0028279","mag":"1593663058"},"language":"en","primary_location":{"id":"doi:10.1007/bfb0028279","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0028279","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":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/165150","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059287546","display_name":"Bernard M. E. Moret","orcid":"https://orcid.org/0000-0003-1549-4544"},"institutions":[{"id":"https://openalex.org/I169521973","display_name":"University of New Mexico","ror":"https://ror.org/05fs6jp91","country_code":"US","type":"education","lineage":["https://openalex.org/I169521973"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bernard M. E. Moret","raw_affiliation_strings":["Department of Computer Science, University of New Mexico, 87131, Albuquerque, NM","University of New Mexico;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of New Mexico, 87131, Albuquerque, NM","institution_ids":["https://openalex.org/I169521973"]},{"raw_affiliation_string":"University of New Mexico;","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109528325","display_name":"Henry D. Shapiro","orcid":null},"institutions":[{"id":"https://openalex.org/I169521973","display_name":"University of New Mexico","ror":"https://ror.org/05fs6jp91","country_code":"US","type":"education","lineage":["https://openalex.org/I169521973"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Henry D. Shapiro","raw_affiliation_strings":["Department of Computer Science, University of New Mexico, 87131, Albuquerque, NM","University of New Mexico;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of New Mexico, 87131, Albuquerque, NM","institution_ids":["https://openalex.org/I169521973"]},{"raw_affiliation_string":"University of New Mexico;","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.221,"has_fulltext":false,"cited_by_count":53,"citation_normalized_percentile":{"value":0.88116393,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"400","last_page":"411"},"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.9976999759674072,"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.9976999759674072,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9916999936103821,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9731000065803528,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/computer-science","display_name":"Computer science","score":0.5979536771774292},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.551964521408081},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5211910605430603},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4944031238555908},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.48931214213371277},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.4369751214981079},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.42918145656585693},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.41252854466438293},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35156822204589844},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31514620780944824},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2136707305908203}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5979536771774292},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.551964521408081},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5211910605430603},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4944031238555908},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.48931214213371277},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.4369751214981079},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.42918145656585693},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.41252854466438293},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35156822204589844},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31514620780944824},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2136707305908203},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/bfb0028279","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0028279","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:CiteSeerX.psu:10.1.1.53.5960","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.5960","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unm.edu/~moret/wads.ps","raw_type":"text"},{"id":"pmh:oai:infoscience.epfl.ch:165150","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/165150","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:165150","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/165150","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1517365704","https://openalex.org/W1963503748","https://openalex.org/W1982512167","https://openalex.org/W2006820476","https://openalex.org/W2012180059","https://openalex.org/W2019235922","https://openalex.org/W2023135239","https://openalex.org/W2063301486","https://openalex.org/W2084224084","https://openalex.org/W2087216833","https://openalex.org/W2128865241","https://openalex.org/W2164485560","https://openalex.org/W4247674447","https://openalex.org/W6631061626","https://openalex.org/W6653391154"],"related_works":["https://openalex.org/W2809748609","https://openalex.org/W3033694952","https://openalex.org/W2372558933","https://openalex.org/W2349288944","https://openalex.org/W2085265870","https://openalex.org/W797244100","https://openalex.org/W4298155039","https://openalex.org/W2043772124","https://openalex.org/W2801186172","https://openalex.org/W2367560286"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}