{"id":"https://openalex.org/W1856509729","doi":"https://doi.org/10.1007/3-540-63397-9_26","title":"Minimum spanning trees in d dimensions","display_name":"Minimum spanning trees in d dimensions","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W1856509729","doi":"https://doi.org/10.1007/3-540-63397-9_26","mag":"1856509729"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-63397-9_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-63397-9_26","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009999441","display_name":"Drago Krznaric","orcid":null},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Drago Krznaric","raw_affiliation_strings":["Department of Computer Science, Lund University, Lund, Sweden","Lund Univ.#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Lund Univ.#TAB#","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005407145","display_name":"Christos Levcopoulos","orcid":"https://orcid.org/0000-0003-0983-7862"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Christos Levcopoulos","raw_affiliation_strings":["Department of Computer Science, Lund University, Lund, Sweden","Lund Univ.#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Lund Univ.#TAB#","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101713320","display_name":"Bengt J. Nilsson","orcid":"https://orcid.org/0000-0002-1342-8618"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Bengt J. Nilsson","raw_affiliation_strings":["Department of Computer Science, Lund University, Lund, Sweden","Lund Univ.#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Lund Univ.#TAB#","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5009999441"],"corresponding_institution_ids":["https://openalex.org/I187531555"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.7488,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.66333333,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"341","last_page":"349"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9980000257492065,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9905999898910522,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8235058784484863},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6454689502716064},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6353110074996948},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.605867326259613},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5887048840522766},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5762425065040588},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.538970410823822},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.5200309753417969},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5155532360076904},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5054304599761963},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4565013349056244},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42179393768310547},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3672414720058441},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.3238184452056885},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11463144421577454},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07426038384437561}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8235058784484863},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6454689502716064},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6353110074996948},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.605867326259613},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5887048840522766},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5762425065040588},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.538970410823822},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.5200309753417969},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5155532360076904},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5054304599761963},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4565013349056244},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42179393768310547},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3672414720058441},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.3238184452056885},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11463144421577454},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07426038384437561},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-63397-9_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-63397-9_26","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1480687013","https://openalex.org/W1973387720","https://openalex.org/W1979109797","https://openalex.org/W1992843866","https://openalex.org/W2005314985","https://openalex.org/W2007610503","https://openalex.org/W2028430839","https://openalex.org/W2031671531","https://openalex.org/W2091146986","https://openalex.org/W2093241092","https://openalex.org/W2094398774","https://openalex.org/W2106110423","https://openalex.org/W2126876121","https://openalex.org/W2911302472","https://openalex.org/W4206241169"],"related_works":["https://openalex.org/W98489388","https://openalex.org/W1985149601","https://openalex.org/W3187208706","https://openalex.org/W3001850742","https://openalex.org/W1561849181","https://openalex.org/W1964611452","https://openalex.org/W4308416203","https://openalex.org/W3099328339","https://openalex.org/W3081212354","https://openalex.org/W4295683043"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}