{"id":"https://openalex.org/W2963690661","doi":"https://doi.org/10.1142/s1793830918500052","title":"Listing all spanning trees in Halin graphs \u2014 sequential and Parallel view","display_name":"Listing all spanning trees in Halin graphs \u2014 sequential and Parallel view","publication_year":2017,"publication_date":"2017-11-14","ids":{"openalex":"https://openalex.org/W2963690661","doi":"https://doi.org/10.1142/s1793830918500052","mag":"2963690661"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830918500052","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830918500052","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, Algorithms and Applications","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/A5103873862","display_name":"K. Krishna Mohan Reddy","orcid":null},"institutions":[{"id":"https://openalex.org/I39244652","display_name":"Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram","ror":"https://ror.org/023c9pb11","country_code":"IN","type":"education","lineage":["https://openalex.org/I39244652"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"K. Krishna Mohan Reddy","raw_affiliation_strings":["Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram, India","institution_ids":["https://openalex.org/I39244652"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005298039","display_name":"P. Renjith","orcid":null},"institutions":[{"id":"https://openalex.org/I39244652","display_name":"Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram","ror":"https://ror.org/023c9pb11","country_code":"IN","type":"education","lineage":["https://openalex.org/I39244652"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"P. Renjith","raw_affiliation_strings":["Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram, India","institution_ids":["https://openalex.org/I39244652"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075479783","display_name":"N. Sadagopan","orcid":null},"institutions":[{"id":"https://openalex.org/I39244652","display_name":"Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram","ror":"https://ror.org/023c9pb11","country_code":"IN","type":"education","lineage":["https://openalex.org/I39244652"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"N. Sadagopan","raw_affiliation_strings":["Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram, India","institution_ids":["https://openalex.org/I39244652"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.30131687,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"10","issue":"01","first_page":"1850005","last_page":"1850005"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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.9993000030517578,"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.8394159078598022},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.733062744140625},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7050802707672119},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5947507619857788},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.574583113193512},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5146397352218628},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.428547739982605},{"id":"https://openalex.org/keywords/cycle-basis","display_name":"Cycle basis","score":0.41393354535102844},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38013923168182373},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1976429522037506},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.15687909722328186}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8394159078598022},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.733062744140625},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7050802707672119},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5947507619857788},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.574583113193512},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5146397352218628},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.428547739982605},{"id":"https://openalex.org/C26752605","wikidata":"https://www.wikidata.org/wiki/Q16766188","display_name":"Cycle basis","level":5,"score":0.41393354535102844},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38013923168182373},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1976429522037506},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.15687909722328186}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830918500052","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830918500052","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, Algorithms and Applications","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":22,"referenced_works":["https://openalex.org/W33341167","https://openalex.org/W415832010","https://openalex.org/W1986646858","https://openalex.org/W1987374783","https://openalex.org/W1991477862","https://openalex.org/W1995040285","https://openalex.org/W2011576097","https://openalex.org/W2022871748","https://openalex.org/W2024460738","https://openalex.org/W2042395260","https://openalex.org/W2052184512","https://openalex.org/W2073647226","https://openalex.org/W2089417393","https://openalex.org/W2090660215","https://openalex.org/W2090931551","https://openalex.org/W2104901438","https://openalex.org/W2120490947","https://openalex.org/W2136620308","https://openalex.org/W2139404577","https://openalex.org/W2237852414","https://openalex.org/W2320198223","https://openalex.org/W2767970464"],"related_works":["https://openalex.org/W2382032469","https://openalex.org/W1966931974","https://openalex.org/W4301179398","https://openalex.org/W4389914601","https://openalex.org/W4231397933","https://openalex.org/W2406749215","https://openalex.org/W2487945693","https://openalex.org/W4292517404","https://openalex.org/W2159421784","https://openalex.org/W2594655405"],"abstract_inverted_index":{"For":[0],"a":[1,8,15,33,52,56,69,73],"connected":[2,16],"labeled":[3],"graph":[4,50,53],"[Formula:":[5,11,25,45,96,104,108,136],"see":[6,12,26,46,97,105,109,137],"text],":[7],"spanning":[9,42,81,130],"tree":[10,57],"text]":[13,98,106,110],"is":[14,38,51,135],"and":[17,63,75,91,107],"acyclic":[18],"subgraph":[19],"that":[20,126],"spans":[21],"all":[22,41,66,80],"vertices":[23,62],"of":[24,44,95,116,119,129],"text].":[27,47,138],"In":[28],"this":[29],"paper,":[30],"we":[31,92],"consider":[32],"classical":[34],"combinatorial":[35],"problem":[36],"which":[37],"to":[39,78],"list":[40],"trees":[43,82,131],"A":[48],"Halin":[49,84,121,133],"obtained":[54],"from":[55],"with":[58,68],"no":[59],"degree":[60],"two":[61],"by":[64],"joining":[65],"leaves":[67],"cycle.":[70],"We":[71,123],"present":[72],"sequential":[74],"parallel":[76,101],"algorithm":[77],"enumerate":[79],"in":[83,132],"graphs.":[85],"Our":[86],"approach":[87],"enumerates":[88],"without":[89],"repetitions":[90],"make":[93],"use":[94],"processors":[99],"for":[100],"algorithmics,":[102],"where":[103],"are":[111],"the":[112,114,120,127],"depth,":[113],"number":[115,128],"leaves,":[117],"respectively,":[118],"graph.":[122],"also":[124],"prove":[125],"graphs":[134]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}