{"id":"https://openalex.org/W1966658892","doi":"https://doi.org/10.1016/s0305-0548(00)00007-1","title":"Minimum-weight spanning tree algorithms A survey and empirical study","display_name":"Minimum-weight spanning tree algorithms A survey and empirical study","publication_year":2001,"publication_date":"2001-07-01","ids":{"openalex":"https://openalex.org/W1966658892","doi":"https://doi.org/10.1016/s0305-0548(00)00007-1","mag":"1966658892"},"language":"en","primary_location":{"id":"doi:10.1016/s0305-0548(00)00007-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(00)00007-1","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"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":"Computers & Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hdl.handle.net/11511/54393","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033658789","display_name":"C\u00fcneyt F. Bazlama\u00e7c\u0131","orcid":"https://orcid.org/0000-0001-8329-5147"},"institutions":[{"id":"https://openalex.org/I201799495","display_name":"Middle East Technical University","ror":"https://ror.org/014weej12","country_code":"TR","type":"education","lineage":["https://openalex.org/I201799495"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"C\u00fcneyt F. Bazlama\u00e7c\u0131","raw_affiliation_strings":["Electrical and Electronics Engineering Department, Middle East Technical University, Ankara 06531, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Electronics Engineering Department, Middle East Technical University, Ankara 06531, Turkey","institution_ids":["https://openalex.org/I201799495"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047878896","display_name":"K.S. Hindi","orcid":null},"institutions":[{"id":"https://openalex.org/I59433898","display_name":"Brunel University of London","ror":"https://ror.org/00dn4t376","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I59433898"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Khalil S. Hindi","raw_affiliation_strings":["Department of Systems Engineering, Brunel University, Uxbridge, Middlesex UB8 3PH, UK","Department of Systems Engineering , Brunel University , Uxbridge, Middlesex UB8 3PH, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Systems Engineering, Brunel University, Uxbridge, Middlesex UB8 3PH, UK","institution_ids":["https://openalex.org/I59433898"]},{"raw_affiliation_string":"Department of Systems Engineering , Brunel University , Uxbridge, Middlesex UB8 3PH, UK","institution_ids":["https://openalex.org/I59433898"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047878896"],"corresponding_institution_ids":["https://openalex.org/I59433898"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":1.3638,"has_fulltext":false,"cited_by_count":101,"citation_normalized_percentile":{"value":0.79474744,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"28","issue":"8","first_page":"767","last_page":"785"},"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.9993000030517578,"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.9993000030517578,"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.9983000159263611,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7245085835456848},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7134803533554077},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5372908115386963},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5362699627876282},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.527126133441925},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.45299527049064636},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44548147916793823},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.4170020520687103},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.27850276231765747}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7245085835456848},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7134803533554077},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5372908115386963},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5362699627876282},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.527126133441925},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.45299527049064636},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44548147916793823},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.4170020520687103},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27850276231765747}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0305-0548(00)00007-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(00)00007-1","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"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":"Computers & Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:open.metu.edu.tr:11511/54393","is_oa":true,"landing_page_url":"https://hdl.handle.net/11511/54393","pdf_url":null,"source":{"id":"https://openalex.org/S4306402495","display_name":"OpenMETU (Middle East Technical University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I201799495","host_organization_name":"Middle East Technical University","host_organization_lineage":["https://openalex.org/I201799495"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":{"id":"pmh:oai:open.metu.edu.tr:11511/54393","is_oa":true,"landing_page_url":"https://hdl.handle.net/11511/54393","pdf_url":null,"source":{"id":"https://openalex.org/S4306402495","display_name":"OpenMETU (Middle East Technical University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I201799495","host_organization_name":"Middle East Technical University","host_organization_lineage":["https://openalex.org/I201799495"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W53596869","https://openalex.org/W582059926","https://openalex.org/W1513400187","https://openalex.org/W1963503748","https://openalex.org/W1965680834","https://openalex.org/W1973942323","https://openalex.org/W1978099551","https://openalex.org/W1982512167","https://openalex.org/W2017927472","https://openalex.org/W2045714801","https://openalex.org/W2055114648","https://openalex.org/W2084224084","https://openalex.org/W2087216833","https://openalex.org/W2094632707","https://openalex.org/W2128865241","https://openalex.org/W2131988410","https://openalex.org/W2133612817","https://openalex.org/W2138304862","https://openalex.org/W2167630072","https://openalex.org/W2297312965","https://openalex.org/W2340389394","https://openalex.org/W2768047182"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W2381121915","https://openalex.org/W4380840098","https://openalex.org/W2390742649","https://openalex.org/W2387385213","https://openalex.org/W1703428550","https://openalex.org/W2360026231","https://openalex.org/W2135993528","https://openalex.org/W2320647101"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}