{"id":"https://openalex.org/W1992843866","doi":"https://doi.org/10.1137/0217035","title":"Minimum Spanning Trees in <i>k</i>-Dimensional Space","display_name":"Minimum Spanning Trees in <i>k</i>-Dimensional Space","publication_year":1988,"publication_date":"1988-06-01","ids":{"openalex":"https://openalex.org/W1992843866","doi":"https://doi.org/10.1137/0217035","mag":"1992843866"},"language":"en","primary_location":{"id":"doi:10.1137/0217035","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0217035","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on 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/A5108215094","display_name":"Pravin M. Vaidya","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Pravin M. Vaidya","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5108215094"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7725,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.76428571,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"17","issue":"3","first_page":"572","last_page":"582"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9997000098228455,"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":0.9997000098228455,"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/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"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/T13282","display_name":"Automated Road and Building Extraction","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"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/spanning-tree","display_name":"Spanning tree","score":0.8571091294288635},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8467295169830322},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7791743278503418},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7604631185531616},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.691044270992279},{"id":"https://openalex.org/keywords/ackermann-function","display_name":"Ackermann function","score":0.6710010170936584},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.659331202507019},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5961208939552307},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.559059202671051},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5020589828491211},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.48928090929985046},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4793413579463959},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4512634575366974},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.41955995559692383},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.3969196081161499},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3959605097770691},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.26623374223709106},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.1274266541004181},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.09726107120513916}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8571091294288635},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8467295169830322},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7791743278503418},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7604631185531616},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.691044270992279},{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.6710010170936584},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.659331202507019},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5961208939552307},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.559059202671051},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5020589828491211},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.48928090929985046},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4793413579463959},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4512634575366974},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.41955995559692383},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.3969196081161499},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3959605097770691},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.26623374223709106},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.1274266541004181},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.09726107120513916},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0217035","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0217035","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W289732966","https://openalex.org/W1965680834","https://openalex.org/W1972969203","https://openalex.org/W1973942323","https://openalex.org/W1986022261","https://openalex.org/W2007610503","https://openalex.org/W2031671531","https://openalex.org/W2128865241","https://openalex.org/W2169528473","https://openalex.org/W2313456371"],"related_works":["https://openalex.org/W1985149601","https://openalex.org/W1997570556","https://openalex.org/W2943635264","https://openalex.org/W2058332489","https://openalex.org/W1587959445","https://openalex.org/W1898478360","https://openalex.org/W1576317141","https://openalex.org/W4239736023","https://openalex.org/W2074417667","https://openalex.org/W1958279402"],"abstract_inverted_index":{"We":[0,52,99],"study":[1],"the":[2,11,27,33,42,45,73,76,92,111,117,131,136,164],"problem":[3],"of":[4,18,29,35,75,94,122,140],"finding":[5,63],"a":[6,15,71,95,106,155],"minimum":[7,66,78,96,107,142],"spanning":[8,67,79,97,108,143],"tree":[9,68,80,109,144],"in":[10,21,69,110,130],"complete":[12,112],"graph":[13,31,113],"on":[14,114,158],"set":[16],"V":[17,120],"n":[19,123],"points":[20,25,40,46],"k-dimensional":[22],"space.":[23],"The":[24],"are":[26],"vertices":[28],"this":[30,141],"and":[32,127,160],"weight":[34,74,93],"an":[36,54,64,102],"edge":[37],"between":[38,44],"two":[39],"is":[41,81,146,154,163],"distance":[43],"under":[47],"some":[48],"$L_q":[49],"$":[50,162],"metric.":[51],"give":[53],"$O(\\varepsilon":[55],"^{":[56],"-":[57],"k}":[58],"n\\log":[59],"n)$":[60],"algorithm":[61,103,145],"for":[62],"approximate":[65,77],"such":[70],"graph;":[72],"guaranteed":[82],"to":[83,104,148],"be":[84,149],"at":[85],"most":[86],"$(1":[87],"+":[88],"\\varepsilon":[89],")$":[90],"times":[91],"tree.":[98],"also":[100],"present":[101],"find":[105],"V.":[115],"Under":[116],"assumption":[118],"that":[119],"consists":[121],"random":[124],"points,":[125],"independently":[126],"uniformly":[128],"distributed":[129],"unit":[132],"k-cube":[133],"$[0,1]^k":[134],"$,":[135],"expected":[137],"running":[138],"time":[139],"shown":[147],"$O(n\\alpha":[150],"(cn,n))$":[151],"where":[152],"c":[153],"constant":[156],"dependent":[157],"k":[159],"$\\alpha":[161],"inverse":[165],"Ackermann":[166],"function.":[167]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}