{"id":"https://openalex.org/W2072970094","doi":"https://doi.org/10.1016/j.dam.2008.03.037","title":"Degree-bounded minimum spanning trees","display_name":"Degree-bounded minimum spanning trees","publication_year":2008,"publication_date":"2008-05-15","ids":{"openalex":"https://openalex.org/W2072970094","doi":"https://doi.org/10.1016/j.dam.2008.03.037","mag":"2072970094"},"language":"en","primary_location":{"id":"doi:10.1016/j.dam.2008.03.037","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.dam.2008.03.037","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","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/A5013914345","display_name":"Raja Jothi","orcid":null},"institutions":[{"id":"https://openalex.org/I1299303238","display_name":"National Institutes of Health","ror":"https://ror.org/01cwqze88","country_code":"US","type":"government","lineage":["https://openalex.org/I1299022934","https://openalex.org/I1299303238"]},{"id":"https://openalex.org/I4210106489","display_name":"National Heart Lung and Blood Institute","ror":"https://ror.org/012pb6c26","country_code":"US","type":"facility","lineage":["https://openalex.org/I1299022934","https://openalex.org/I1299303238","https://openalex.org/I4210106489"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Raja Jothi","raw_affiliation_strings":["Laboratory of Molecular Immunology, National Heart Lung and Blood Institute, National Institutes of Health, Rockville, MD 20892, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory of Molecular Immunology, National Heart Lung and Blood Institute, National Institutes of Health, Rockville, MD 20892, USA","institution_ids":["https://openalex.org/I4210106489","https://openalex.org/I1299303238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046140110","display_name":"Balaji Raghavachari","orcid":null},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Balaji Raghavachari","raw_affiliation_strings":["Department of Computer Science, University of Texas at Dallas, TX 75080, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, TX 75080, USA#TAB#","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":7.4483,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.96162101,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"157","issue":"5","first_page":"960","last_page":"970"},"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/T10374","display_name":"Advanced Graph Theory Research","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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9919999837875366,"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/mathematics","display_name":"Mathematics","score":0.8601264953613281},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8119144439697266},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7990247011184692},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7819961309432983},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.7498473525047302},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6965349316596985},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6870196461677551},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.6529644131660461},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.6009417176246643},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.539742112159729},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5343114137649536},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.4480127990245819},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4311254620552063},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.42998093366622925},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1411420702934265},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.1340189278125763},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.12347021698951721},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08795318007469177},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07132050395011902},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.06088879704475403}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8601264953613281},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8119144439697266},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7990247011184692},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7819961309432983},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.7498473525047302},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6965349316596985},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6870196461677551},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.6529644131660461},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.6009417176246643},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.539742112159729},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5343114137649536},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.4480127990245819},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4311254620552063},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.42998093366622925},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1411420702934265},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.1340189278125763},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.12347021698951721},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08795318007469177},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07132050395011902},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.06088879704475403},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.dam.2008.03.037","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.dam.2008.03.037","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","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":24,"referenced_works":["https://openalex.org/W1520111182","https://openalex.org/W1566313961","https://openalex.org/W1601487505","https://openalex.org/W1975884818","https://openalex.org/W1994248285","https://openalex.org/W1995350474","https://openalex.org/W1998141189","https://openalex.org/W2002985966","https://openalex.org/W2011039300","https://openalex.org/W2022563199","https://openalex.org/W2023457294","https://openalex.org/W2055336889","https://openalex.org/W2055505431","https://openalex.org/W2056839231","https://openalex.org/W2063807274","https://openalex.org/W2066700938","https://openalex.org/W2088839217","https://openalex.org/W2110367141","https://openalex.org/W2116680937","https://openalex.org/W2165142526","https://openalex.org/W2167579893","https://openalex.org/W2171319172","https://openalex.org/W2602800732","https://openalex.org/W3099328339"],"related_works":["https://openalex.org/W1985149601","https://openalex.org/W1997570556","https://openalex.org/W4308416203","https://openalex.org/W1964611452","https://openalex.org/W2943635264","https://openalex.org/W2059360098","https://openalex.org/W2058332489","https://openalex.org/W3016811403","https://openalex.org/W1576317141","https://openalex.org/W4224074580"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}