{"id":"https://openalex.org/W2973125465","doi":"https://doi.org/10.1109/tit.2019.2940263","title":"Maximizing the Number of Spanning Trees in a Connected Graph","display_name":"Maximizing the Number of Spanning Trees in a Connected Graph","publication_year":2019,"publication_date":"2019-09-11","ids":{"openalex":"https://openalex.org/W2973125465","doi":"https://doi.org/10.1109/tit.2019.2940263","mag":"2973125465"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2019.2940263","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2019.2940263","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","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/A5100319233","display_name":"Huan Li","orcid":"https://orcid.org/0000-0002-7840-1053"},"institutions":[{"id":"https://openalex.org/I24943067","display_name":"Fudan University","ror":"https://ror.org/013q1eq08","country_code":"CN","type":"education","lineage":["https://openalex.org/I24943067"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Huan Li","raw_affiliation_strings":["Fudan-Zhongan Joint Laboratory of Blockchain and Information Security, Shanghai Engineering Research Institute of Blockchain, Shanghai, China","Shanghai Key Laboratory of Intelligent Information Processing, School of Computer Science, Fudan University, Shanghai, China"],"raw_orcid":"https://orcid.org/0000-0002-7840-1053","affiliations":[{"raw_affiliation_string":"Fudan-Zhongan Joint Laboratory of Blockchain and Information Security, Shanghai Engineering Research Institute of Blockchain, Shanghai, China","institution_ids":[]},{"raw_affiliation_string":"Shanghai Key Laboratory of Intelligent Information Processing, School of Computer Science, Fudan University, Shanghai, China","institution_ids":["https://openalex.org/I24943067"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081738999","display_name":"Stacy Patterson","orcid":"https://orcid.org/0000-0001-7711-6018"},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stacy Patterson","raw_affiliation_strings":["Department of Computer Science, Rensselaer Polytechnic Institute, Troy, USA"],"raw_orcid":"https://orcid.org/0000-0001-7711-6018","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rensselaer Polytechnic Institute, Troy, USA","institution_ids":["https://openalex.org/I165799507"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062353872","display_name":"Yuhao Yi","orcid":"https://orcid.org/0000-0001-6036-0276"},"institutions":[{"id":"https://openalex.org/I24943067","display_name":"Fudan University","ror":"https://ror.org/013q1eq08","country_code":"CN","type":"education","lineage":["https://openalex.org/I24943067"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuhao Yi","raw_affiliation_strings":["Fudan-Zhongan Joint Laboratory of Blockchain and Information Security, Shanghai Engineering Research Institute of Blockchain, Shanghai, China","Shanghai Key Laboratory of Intelligent Information Processing, School of Computer Science, Fudan University, Shanghai, China"],"raw_orcid":"https://orcid.org/0000-0001-6036-0276","affiliations":[{"raw_affiliation_string":"Fudan-Zhongan Joint Laboratory of Blockchain and Information Security, Shanghai Engineering Research Institute of Blockchain, Shanghai, China","institution_ids":[]},{"raw_affiliation_string":"Shanghai Key Laboratory of Intelligent Information Processing, School of Computer Science, Fudan University, Shanghai, China","institution_ids":["https://openalex.org/I24943067"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067533846","display_name":"Zhongzhi Zhang","orcid":"https://orcid.org/0000-0003-1260-2079"},"institutions":[{"id":"https://openalex.org/I24943067","display_name":"Fudan University","ror":"https://ror.org/013q1eq08","country_code":"CN","type":"education","lineage":["https://openalex.org/I24943067"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhongzhi Zhang","raw_affiliation_strings":["Fudan-Zhongan Joint Laboratory of Blockchain and Information Security, Shanghai Engineering Research Institute of Blockchain, Shanghai, China","Shanghai Key Laboratory of Intelligent Information Processing, School of Computer Science, Fudan University, Shanghai, China"],"raw_orcid":"https://orcid.org/0000-0003-1260-2079","affiliations":[{"raw_affiliation_string":"Fudan-Zhongan Joint Laboratory of Blockchain and Information Security, Shanghai Engineering Research Institute of Blockchain, Shanghai, China","institution_ids":[]},{"raw_affiliation_string":"Shanghai Key Laboratory of Intelligent Information Processing, School of Computer Science, Fudan University, Shanghai, China","institution_ids":["https://openalex.org/I24943067"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1750,"currency":"USD","value_usd":1750},"apc_paid":null,"fwci":2.3741,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.89935211,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"66","issue":"2","first_page":"1248","last_page":"1260"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.7931337952613831},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.7265520095825195},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6543757319450378},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6383559107780457},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6245301365852356},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5492333769798279},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5435971021652222},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5416674017906189},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45129650831222534},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4472714364528656},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.43588370084762573},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.42438217997550964},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4136978089809418},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24096065759658813}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7931337952613831},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.7265520095825195},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6543757319450378},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6383559107780457},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6245301365852356},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5492333769798279},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5435971021652222},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5416674017906189},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45129650831222534},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4472714364528656},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.43588370084762573},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.42438217997550964},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4136978089809418},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24096065759658813},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2019.2940263","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2019.2940263","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G176170237","display_name":"CSR: III: Small:  Collaborative Research:  A Hybrid Vehicle-Cloud Solution for Robust, Cost-Efficient Road Monitoring","funder_award_id":"1527287","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G537946182","display_name":null,"funder_award_id":"61872093","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G5434137028","display_name":"CAREER: Toward A Machine Learning Framework for the Internet of Things","funder_award_id":"1553340","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":60,"referenced_works":["https://openalex.org/W1521148214","https://openalex.org/W1680189815","https://openalex.org/W1826690079","https://openalex.org/W1916091028","https://openalex.org/W1938602245","https://openalex.org/W1983193888","https://openalex.org/W1984323008","https://openalex.org/W2005962499","https://openalex.org/W2014255080","https://openalex.org/W2024426511","https://openalex.org/W2024908906","https://openalex.org/W2029673229","https://openalex.org/W2058706632","https://openalex.org/W2064169939","https://openalex.org/W2066303074","https://openalex.org/W2077157637","https://openalex.org/W2087555137","https://openalex.org/W2112556110","https://openalex.org/W2116673134","https://openalex.org/W2117889403","https://openalex.org/W2135927639","https://openalex.org/W2137653284","https://openalex.org/W2139297408","https://openalex.org/W2141355868","https://openalex.org/W2155965886","https://openalex.org/W2160411082","https://openalex.org/W2163927416","https://openalex.org/W2164934569","https://openalex.org/W2252172643","https://openalex.org/W2290818619","https://openalex.org/W2336483534","https://openalex.org/W2388242991","https://openalex.org/W2410275234","https://openalex.org/W2418223327","https://openalex.org/W2508721896","https://openalex.org/W2552685338","https://openalex.org/W2748196059","https://openalex.org/W2769899835","https://openalex.org/W2778836815","https://openalex.org/W2787403060","https://openalex.org/W2797925981","https://openalex.org/W2807192154","https://openalex.org/W2953287872","https://openalex.org/W2962680036","https://openalex.org/W2962800567","https://openalex.org/W2962911929","https://openalex.org/W2963122331","https://openalex.org/W2964269311","https://openalex.org/W2964343692","https://openalex.org/W2999726870","https://openalex.org/W3100100463","https://openalex.org/W3102629426","https://openalex.org/W3104306072","https://openalex.org/W4231490457","https://openalex.org/W4247782380","https://openalex.org/W4300029251","https://openalex.org/W4301347875","https://openalex.org/W6703945023","https://openalex.org/W6742756875","https://openalex.org/W6746756823"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W2044443696","https://openalex.org/W1703428550","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181"],"abstract_inverted_index":{"We":[0,43,54,159],"study":[1],"the":[2,6,71,74,104,114,119,132,135,161,184,191],"problem":[3,36,166],"of":[4,8,31,64,73,76,118,137,141,164,187],"maximizing":[5],"number":[7,75,186],"spanning":[9,77,188],"trees":[10,78,189],"in":[11,40,70,84,131,155,190],"a":[12,28,35,56,172],"connected":[13],"graph":[14],"with":[15,101,124],"n":[16],"vertices":[17],"and":[18,47,111],"m":[19],"edges,":[20,34],"by":[21,167],"adding":[22],"at":[23],"most":[24],"k":[25,142],"edges":[26],"from":[27],"given":[29],"set":[30],"q":[32],"candidate":[33],"that":[37,59,152,169,178],"has":[38],"applications":[39],"many":[41],"domains.":[42],"give":[44,55],"both":[45],"algorithmic":[46],"hardness":[48],"results":[49],"for":[50,79],"this":[51,165],"problem:":[52],"1)":[53],"greedy":[57,122],"algorithm":[58,123],"obtains":[60],"an":[61,125],"approximation":[62,126],"ratio":[63,127],"(1":[65,128,194],"-":[66,68,129,195],"1/e":[67],"\u2208)":[69],"exponent":[72,192],"any":[80],"\u2208":[81],">":[82,175],"0":[83,176],"time":[85,98,117,140],"\u00d5(m\u2208-1+":[86],"(n":[87],"+":[88],"q)\u2208-3),":[89],"where":[90],"\u00d5(\u00b7)":[91],"hides":[92],"poly":[93],"log(n)":[94],"factors.":[95],"Our":[96],"running":[97,116,139],"is":[99,143,180],"optimal":[100],"respect":[102],"to":[103,108,146,182],"input":[105],"size,":[106],"up":[107],"logarithmic":[109],"factors,":[110],"improves":[112],"on":[113,150],"O(n3)":[115],"previous":[120],"proposed":[121],"1/e)":[130],"exponent.":[133],"Notably,":[134],"independence":[136],"our":[138],"novel,":[144],"compared":[145],"conventional":[147],"top-k":[148],"selections":[149],"graphs":[151],"usually":[153],"run":[154],"\u03a9(mk)":[156],"time.":[157],"2)":[158],"show":[160],"exponential":[162],"inapproximability":[163],"proving":[168],"there":[170],"exists":[171],"constant":[173],"c":[174],"such":[177],"it":[179],"NP-hard":[181],"approximate":[183],"optimum":[185],"within":[193],"c).":[196]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1}],"updated_date":"2026-08-28T12:50:07.497085","created_date":"2025-10-10T00:00:00"}