{"id":"https://openalex.org/W1985783557","doi":"https://doi.org/10.1002/net.3230070405","title":"Minimal ratio spanning trees","display_name":"Minimal ratio spanning trees","publication_year":1977,"publication_date":"1977-12-01","ids":{"openalex":"https://openalex.org/W1985783557","doi":"https://doi.org/10.1002/net.3230070405","mag":"1985783557"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230070405","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230070405","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5101650264","display_name":"R. Chandrasekaran","orcid":"https://orcid.org/0000-0002-4665-7847"},"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":true,"raw_author_name":"R. Chandrasekaran","raw_affiliation_strings":["University of Texas at Dallas Richardson, Texas","University of Texas at Dallas, Richardson, Texas"],"affiliations":[{"raw_affiliation_string":"University of Texas at Dallas Richardson, Texas","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"University of Texas at Dallas, Richardson, Texas","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101650264"],"corresponding_institution_ids":["https://openalex.org/I162577319"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":69,"citation_normalized_percentile":{"value":0.11479466,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"7","issue":"4","first_page":"335","last_page":"342"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9993000030517578,"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/T11476","display_name":"Graph theory and applications","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.7267370820045471},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7073554992675781},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6365411281585693},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.6236734986305237},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5474952459335327},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.547310471534729},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.49953246116638184},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4841535687446594},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.46786049008369446},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.45091986656188965},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44109034538269043},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4125169813632965},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3966625928878784},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33615630865097046},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23645147681236267}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7267370820045471},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7073554992675781},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6365411281585693},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.6236734986305237},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5474952459335327},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.547310471534729},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.49953246116638184},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4841535687446594},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.46786049008369446},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.45091986656188965},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44109034538269043},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4125169813632965},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3966625928878784},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33615630865097046},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23645147681236267},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230070405","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230070405","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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":8,"referenced_works":["https://openalex.org/W1964119857","https://openalex.org/W1965680834","https://openalex.org/W1973942323","https://openalex.org/W1991528957","https://openalex.org/W2017927472","https://openalex.org/W2125690626","https://openalex.org/W2128865241","https://openalex.org/W4244926293"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2943635264","https://openalex.org/W2138987445","https://openalex.org/W2387385213","https://openalex.org/W2589768050","https://openalex.org/W2357347008","https://openalex.org/W4242086819","https://openalex.org/W2074214908","https://openalex.org/W2109692093","https://openalex.org/W3016811403"],"abstract_inverted_index":{"Abstract":[0],"Given":[1],"an":[2,13,69],"undirected":[3],"graph":[4],"G:":[5],"(N;E)":[6],"with":[7],"a":[8,30,39],"node":[9],"set":[10,15],"N":[11],"and":[12,17,21],"edge":[14],"E":[16],"numbers":[18],"C":[19],"e":[20,23,25],"D":[22],",":[24],"\u03f5":[26],"E,":[27],"we":[28],"provide":[29],"polynominally":[31],"bounded":[32],"algorithm":[33,70],"to":[34,53],"solve":[35],"the":[36,45,75],"problem:":[37],"Find":[38],"spanning":[40],"tree":[41],"T":[42],"such":[43,60],"that":[44,58,68,71],"ratio":[46,61],"magnified":[47],"image":[48],"is":[49,63,66,72],"minimized.":[50],"An":[51],"extension":[52],"finding":[54],"bases":[55],"in":[56,74],"matroids":[57],"minimize":[59],"functions":[62],"immediate.":[64],"It":[65],"shown":[67],"\u201cgreedy,\u201d":[73],"sense":[76],"of":[77],"Edmonds":[78],"[2],":[79],"will":[80],"not":[81],"work":[82],"for":[83],"this":[84],"problem.":[85]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}