{"id":"https://openalex.org/W2128865241","doi":"https://doi.org/10.1137/0205051","title":"Finding Minimum Spanning Trees","display_name":"Finding Minimum Spanning Trees","publication_year":1976,"publication_date":"1976-12-01","ids":{"openalex":"https://openalex.org/W2128865241","doi":"https://doi.org/10.1137/0205051","mag":"2128865241"},"language":"en","primary_location":{"id":"doi:10.1137/0205051","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0205051","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/A5032416534","display_name":"David R. Cheriton","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"David Cheriton","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert Endre Tarjan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032416534"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":22.4952,"has_fulltext":false,"cited_by_count":426,"citation_normalized_percentile":{"value":0.99684543,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"5","issue":"4","first_page":"724","last_page":"742"},"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.9957000017166138,"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.9957000017166138,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9940999746322632,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9937000274658203,"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.8212618827819824},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7511895895004272},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6444034576416016},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.639362096786499},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5104788541793823},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.4993596076965332},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48618143796920776},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4327915608882904},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4075355529785156},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.1246890127658844},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.1120004653930664},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.09435483813285828},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.061477869749069214}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8212618827819824},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7511895895004272},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6444034576416016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.639362096786499},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5104788541793823},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.4993596076965332},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48618143796920776},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4327915608882904},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4075355529785156},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.1246890127658844},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.1120004653930664},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.09435483813285828},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.061477869749069214},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0205051","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0205051","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":12,"referenced_works":["https://openalex.org/W1504925519","https://openalex.org/W1655990431","https://openalex.org/W1965680834","https://openalex.org/W1969148345","https://openalex.org/W1973942323","https://openalex.org/W1986022261","https://openalex.org/W1987374783","https://openalex.org/W1988615825","https://openalex.org/W1996641400","https://openalex.org/W2017927472","https://openalex.org/W2118382442","https://openalex.org/W2169528473"],"related_works":["https://openalex.org/W3016811403","https://openalex.org/W1985149601","https://openalex.org/W1964611452","https://openalex.org/W2130375301","https://openalex.org/W2390742649","https://openalex.org/W2943635264","https://openalex.org/W2400989246","https://openalex.org/W4308416203","https://openalex.org/W2084694919","https://openalex.org/W1561849181"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"methods":[3],"for":[4,45,49,59,70,84],"finding":[5],"minimum":[6,89],"spanning":[7,90],"trees":[8],"in":[9,36],"graphs.":[10],"Results":[11],"include":[12],"1.":[13],"several":[14],"algorithms":[15],"with":[16,75],"$O(m\\log":[17],"\\log":[18],"n)$":[19],"worst-case":[20,43,68],"running":[21],"times,":[22],"where":[23],"n":[24],"is":[25,31,52],"the":[26,32,37,85,88],"number":[27,33],"vertices":[28],"and":[29],"m":[30,51],"of":[34,87],"edges":[35],"problem":[38],"graph;":[39],"2.":[40],"an":[41,66],"$O(m)$":[42],"algorithm":[44,69],"dense":[46],"graphs":[47],"(those":[48],"which":[50,78],"$\\Omega":[53],"(n^{1":[54],"+":[55],"\\varepsilon":[56],"}":[57],")$":[58],"some":[60],"positive":[61],"constant":[62],"$\\varepsilon":[63],"$);":[64],"3.":[65],"$O(n)$":[67],"planar":[71],"graphs;":[72],"4.":[73],"relationships":[74],"other":[76],"problems":[77],"might":[79],"lead":[80],"general":[81],"lower":[82],"bound":[83],"complexity":[86],"tree":[91],"problem.":[92]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":13}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}