{"id":"https://openalex.org/W2018359542","doi":"https://doi.org/10.1109/tc.1978.1675043","title":"Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces","display_name":"Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces","publication_year":1978,"publication_date":"1978-02-01","ids":{"openalex":"https://openalex.org/W2018359542","doi":"https://doi.org/10.1109/tc.1978.1675043","mag":"2018359542"},"language":"en","primary_location":{"id":"doi:10.1109/tc.1978.1675043","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1978.1675043","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","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/A5069644878","display_name":"Bentley","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bentley","raw_affiliation_strings":["Department of Computer Science, Carnegie-Mellon University","Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Carnegie-Mellon University","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102101600","display_name":"Friedman","orcid":null},"institutions":[{"id":"https://openalex.org/I4210120900","display_name":"Stanford Synchrotron Radiation Lightsource","ror":"https://ror.org/02vzbm991","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I2801935854","https://openalex.org/I39565521","https://openalex.org/I4210120900","https://openalex.org/I97018004","https://openalex.org/I97018004"]},{"id":"https://openalex.org/I2801935854","display_name":"SLAC National Accelerator Laboratory","ror":"https://ror.org/05gzmn429","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I2801935854","https://openalex.org/I39565521","https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Friedman","raw_affiliation_strings":["Stanford Linear Accelerator Center, University of Stanford, Stanford, CA, USA"],"affiliations":[{"raw_affiliation_string":"Stanford Linear Accelerator Center, University of Stanford, Stanford, CA, USA","institution_ids":["https://openalex.org/I4210120900","https://openalex.org/I2801935854"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5069644878"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":5.9014,"has_fulltext":false,"cited_by_count":119,"citation_normalized_percentile":{"value":0.96590909,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"C-27","issue":"2","first_page":"97","last_page":"105"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10799","display_name":"Data Visualization and Analytics","score":0.9894000291824341,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.8986181020736694},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6600365042686462},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6324151754379272},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.57501220703125},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.5294895768165588},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5289561748504639},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.48790737986564636},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.4724448323249817},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4699442684650421},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4616377055644989},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.460613489151001},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4427393078804016},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4230669140815735},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.41805410385131836},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3650828003883362}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8986181020736694},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6600365042686462},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6324151754379272},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.57501220703125},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.5294895768165588},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5289561748504639},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.48790737986564636},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.4724448323249817},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4699442684650421},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4616377055644989},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.460613489151001},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4427393078804016},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4230669140815735},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41805410385131836},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3650828003883362},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.1978.1675043","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1978.1675043","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","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":21,"referenced_works":["https://openalex.org/W108464071","https://openalex.org/W604114580","https://openalex.org/W1552865903","https://openalex.org/W1589747065","https://openalex.org/W1608549080","https://openalex.org/W1965680834","https://openalex.org/W1966368937","https://openalex.org/W1968778433","https://openalex.org/W1972969203","https://openalex.org/W1973942323","https://openalex.org/W1974784305","https://openalex.org/W1998871699","https://openalex.org/W2017927472","https://openalex.org/W2024668293","https://openalex.org/W2034024086","https://openalex.org/W2125078521","https://openalex.org/W2169528473","https://openalex.org/W2752853835","https://openalex.org/W3198470706","https://openalex.org/W4247185857","https://openalex.org/W4255306344"],"related_works":["https://openalex.org/W2014991506","https://openalex.org/W4380840098","https://openalex.org/W2307044859","https://openalex.org/W2099915933","https://openalex.org/W2387385213","https://openalex.org/W2047517090","https://openalex.org/W620960161","https://openalex.org/W2943635264","https://openalex.org/W3016811403","https://openalex.org/W4239736023"],"abstract_inverted_index":{"Algorithms":[0],"are":[1],"presented":[2,51],"that":[3,38,52,57],"construct":[4,41],"the":[5,27,35],"shortest":[6],"connecting":[7],"network,":[8],"or":[9],"minimal":[10,61],"spanning":[11,55],"tree":[12,56],"(MST),":[13],"of":[14,26,29,43],"N":[15,66,68],"points":[16],"embedded":[17],"in":[18],"k-dimensional":[19],"coordinate":[20],"space.":[21],"These":[22],"algorithms":[23],"take":[24],"advantage":[25],"geometry":[28],"such":[30],"spaces":[31],"to":[32,40,65],"substantially":[33],"reduce":[34],"computation":[36,63],"from":[37],"required":[39],"MST's":[42],"more":[44],"general":[45],"graphs.":[46],"An":[47],"algorithm":[48],"is":[49,58],"also":[50],"constructs":[53],"a":[54],"very":[59],"nearly":[60],"with":[62],"proportional":[64],"log":[67],"for":[69],"all":[70],"k.":[71]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":15},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":6}],"updated_date":"2026-03-09T08:58:05.943551","created_date":"2025-10-10T00:00:00"}