{"id":"https://openalex.org/W4409898124","doi":"https://doi.org/10.1142/s0129054125500054","title":"Efficiently Enumerating Spanning Trees of <i>k</i> -Trees","display_name":"Efficiently Enumerating Spanning Trees of <i>k</i> -Trees","publication_year":2025,"publication_date":"2025-04-26","ids":{"openalex":"https://openalex.org/W4409898124","doi":"https://doi.org/10.1142/s0129054125500054"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054125500054","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054125500054","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5080006785","display_name":"Muhammad Nur Yanhaona","orcid":"https://orcid.org/0000-0003-2450-3377"},"institutions":[{"id":"https://openalex.org/I5518804","display_name":"BRAC University","ror":"https://ror.org/00sge8677","country_code":"BD","type":"education","lineage":["https://openalex.org/I5518804"]}],"countries":["BD"],"is_corresponding":true,"raw_author_name":"Muhammad Nur Yanhaona","raw_affiliation_strings":["Department of Computer Science and Engineering, BRAC University, Dhaka, Bangladesh"],"raw_orcid":"https://orcid.org/0000-0003-2450-3377","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, BRAC University, Dhaka, Bangladesh","institution_ids":["https://openalex.org/I5518804"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021829484","display_name":"Rahnuma Islam Nishat","orcid":"https://orcid.org/0000-0001-6987-4855"},"institutions":[{"id":"https://openalex.org/I186803428","display_name":"Brock University","ror":"https://ror.org/056am2717","country_code":"CA","type":"education","lineage":["https://openalex.org/I186803428"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Rahnuma Islam Nishat","raw_affiliation_strings":["Department of Computer Science, Brock University, ON, Canada"],"raw_orcid":"https://orcid.org/0000-0001-6987-4855","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brock University, ON, Canada","institution_ids":["https://openalex.org/I186803428"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030110155","display_name":"Md. Saidur Rahman","orcid":"https://orcid.org/0000-0003-0112-0242"},"institutions":[{"id":"https://openalex.org/I183697816","display_name":"Bangladesh University of Engineering and Technology","ror":"https://ror.org/05a1qpv97","country_code":"BD","type":"education","lineage":["https://openalex.org/I183697816"]}],"countries":["BD"],"is_corresponding":false,"raw_author_name":"Md. Saidur Rahman","raw_affiliation_strings":["Graph Drawing and Information Visualization Laboratory, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), Dhaka, Bangladesh"],"raw_orcid":"https://orcid.org/0000-0003-0112-0242","affiliations":[{"raw_affiliation_string":"Graph Drawing and Information Visualization Laboratory, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), Dhaka, Bangladesh","institution_ids":["https://openalex.org/I183697816"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5080006785"],"corresponding_institution_ids":["https://openalex.org/I5518804"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09542384,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"36","issue":"08","first_page":"1173","last_page":"1203"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9983000159263611,"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.9983000159263611,"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.9970999956130981,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9944000244140625,"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/spanning-tree","display_name":"Spanning tree","score":0.7883286476135254},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6409782767295837},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6062690019607544},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5871774554252625},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.49627190828323364},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4413120448589325},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43436336517333984},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.43420520424842834},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.21798580884933472},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.14370879530906677},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.12574976682662964},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06601548194885254},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.06250816583633423}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7883286476135254},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6409782767295837},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6062690019607544},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5871774554252625},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.49627190828323364},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4413120448589325},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43436336517333984},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.43420520424842834},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21798580884933472},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.14370879530906677},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.12574976682662964},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06601548194885254},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.06250816583633423}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054125500054","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054125500054","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320325821","display_name":"Bangladesh University of Engineering and Technology","ror":"https://ror.org/05a1qpv97"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W344142806","https://openalex.org/W659038795","https://openalex.org/W1978493550","https://openalex.org/W1986646858","https://openalex.org/W1988738304","https://openalex.org/W2022871748","https://openalex.org/W2023286509","https://openalex.org/W2044338030","https://openalex.org/W2073647226","https://openalex.org/W2074099251","https://openalex.org/W2087216833","https://openalex.org/W2088320806","https://openalex.org/W2100831780","https://openalex.org/W2107851624","https://openalex.org/W2119567838","https://openalex.org/W2125367520","https://openalex.org/W2130586999","https://openalex.org/W2138981210","https://openalex.org/W2151285717","https://openalex.org/W2308777515","https://openalex.org/W2767970464","https://openalex.org/W4244346108","https://openalex.org/W4250968050","https://openalex.org/W4366958292"],"related_works":["https://openalex.org/W2382032469","https://openalex.org/W4301179398","https://openalex.org/W4389914601","https://openalex.org/W4231397933","https://openalex.org/W2406749215","https://openalex.org/W1966931974","https://openalex.org/W2487945693","https://openalex.org/W2159421784","https://openalex.org/W4292517404","https://openalex.org/W2052473415"],"abstract_inverted_index":{"A":[0],"spanning":[1,37,63,93,111],"tree":[2,28,112],"T":[3],"of":[4,13,19,25,33,39,65],"a":[5,43,81,97],"connected":[6],"graph":[7,47],"G":[8,14,20,40,83],"is":[9,30,42,96],"an":[10,59],"acyclic":[11],"subgraph":[12],"that":[15,67],"connects":[16],"all":[17,35],"vertices":[18],"with":[21,49],"the":[22,31,105,109],"minimum":[23],"number":[24],"edges.":[26],"Spanning":[27],"enumeration":[29,113],"problem":[32,45],"finding":[34],"distinct":[36],"trees":[38,64],"and":[41,74,89,124],"well-studied":[44],"in":[46,51,69,100],"theory":[48],"applications":[50],"various":[52],"fields.":[53],"In":[54],"this":[55],"paper,":[56],"we":[57],"propose":[58],"algorithm":[60,114],"for":[61,80,115],"enumerating":[62],"k-trees":[66],"runs":[68],"[Formula:":[70,76,90,120,127],"see":[71,77,91,121,128],"text]":[72,78,92,122,129],"time":[73,101,123],"takes":[75,119],"space":[79,106],"k-tree":[82],"having":[84],"n":[85],"vertices,":[86],"m":[87],"edges,":[88],"trees.":[94],"This":[95],"substantial":[98],"improvement":[99],"complexity":[102],"without":[103],"increasing":[104],"cost":[107],"over":[108],"best":[110],"general":[116],"graphs":[117],"which":[118],"also":[125],"requires":[126],"space.":[130]},"counts_by_year":[],"updated_date":"2025-12-11T23:09:37.256380","created_date":"2025-10-10T00:00:00"}