{"id":"https://openalex.org/W1494488763","doi":"https://doi.org/10.1007/978-0-387-30162-4_239","title":"Minimum Spanning Trees","display_name":"Minimum Spanning Trees","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1494488763","doi":"https://doi.org/10.1007/978-0-387-30162-4_239","mag":"1494488763"},"language":"en","primary_location":{"id":"doi:10.1007/978-0-387-30162-4_239","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-0-387-30162-4_239","pdf_url":null,"source":{"id":"https://openalex.org/S4306509317","display_name":"Encyclopedia of Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Encyclopedia of Algorithms","raw_type":"book-chapter"},"type":"reference-entry","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/A5076564426","display_name":"Seth Pettie","orcid":"https://orcid.org/0000-0002-0495-3904"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Seth Pettie","raw_affiliation_strings":["EECS Department, University of Michigan, Ann Arbor, MI, USA","(University of Michigan)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EECS Department, University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"(University of Michigan)","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5076564426"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"1325"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994000196456909,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/combinatorics","display_name":"Combinatorics","score":0.8600306510925293},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7604571580886841},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7412633895874023},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6105285286903381},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.5666825175285339},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5467520952224731},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.5146108865737915},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.48848283290863037},{"id":"https://openalex.org/keywords/geometric-graph-theory","display_name":"Geometric graph theory","score":0.4879547953605652},{"id":"https://openalex.org/keywords/weight-function","display_name":"Weight function","score":0.46588483452796936},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4587872326374054},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4265732765197754},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.41813692450523376},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.37028634548187256},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3543015122413635},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.18681997060775757},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12191537022590637},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.107479989528656}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8600306510925293},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7604571580886841},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7412633895874023},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6105285286903381},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.5666825175285339},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5467520952224731},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.5146108865737915},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.48848283290863037},{"id":"https://openalex.org/C173547177","wikidata":"https://www.wikidata.org/wiki/Q1503271","display_name":"Geometric graph theory","level":5,"score":0.4879547953605652},{"id":"https://openalex.org/C134466208","wikidata":"https://www.wikidata.org/wiki/Q1520657","display_name":"Weight function","level":2,"score":0.46588483452796936},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4587872326374054},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4265732765197754},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.41813692450523376},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.37028634548187256},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3543015122413635},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.18681997060775757},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12191537022590637},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.107479989528656},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-0-387-30162-4_239","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-0-387-30162-4_239","pdf_url":null,"source":{"id":"https://openalex.org/S4306509317","display_name":"Encyclopedia of Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Encyclopedia of Algorithms","raw_type":"book-chapter"},{"id":"doi:10.1007/978-1-4939-2864-4_239","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-1-4939-2864-4_239","pdf_url":null,"source":{"id":"https://openalex.org/S4306509317","display_name":"Encyclopedia of Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Encyclopedia of Algorithms","raw_type":"book-chapter"},{"id":"doi:10.1007/978-3-642-27848-8_239-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-27848-8_239-2","pdf_url":null,"source":{"id":"https://openalex.org/S4306509317","display_name":"Encyclopedia of Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Encyclopedia of Algorithms","raw_type":"book-chapter"},{"id":"mag:1494488763","is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/reference/algo/algo2008.html#Pettie08a","pdf_url":null,"source":{"id":"https://openalex.org/S4306509317","display_name":"Encyclopedia of Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Encyclopedia of Algorithms","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1410754138","https://openalex.org/W1513400187","https://openalex.org/W1887769558","https://openalex.org/W1965525854","https://openalex.org/W1982512167","https://openalex.org/W1999545213","https://openalex.org/W2011824743","https://openalex.org/W2032841680","https://openalex.org/W2049069130","https://openalex.org/W2065105907","https://openalex.org/W2087216833","https://openalex.org/W2113116892","https://openalex.org/W2138304862","https://openalex.org/W2160495255","https://openalex.org/W2911302472","https://openalex.org/W4253639210"],"related_works":["https://openalex.org/W172707356","https://openalex.org/W2082095538","https://openalex.org/W2125524215","https://openalex.org/W2951308702","https://openalex.org/W132346723","https://openalex.org/W1568130742","https://openalex.org/W2183786889","https://openalex.org/W193918669","https://openalex.org/W1599894364","https://openalex.org/W2185068122","https://openalex.org/W2379819905","https://openalex.org/W2487945693","https://openalex.org/W2022871748","https://openalex.org/W2406749215","https://openalex.org/W2253189575","https://openalex.org/W1543270570","https://openalex.org/W1507697328","https://openalex.org/W1963619425","https://openalex.org/W575020065","https://openalex.org/W2121473031"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-16T13:24:37.021932","created_date":"2025-10-10T00:00:00"}