{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T09:05:31Z","timestamp":1758704731450,"version":"3.37.3"},"reference-count":46,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST111-2221-E-131-012"],"award-info":[{"award-number":["MOST111-2221-E-131-012"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST111-2221-E-141-006"],"award-info":[{"award-number":["MOST111-2221-E-141-006"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2024,8]]},"abstract":"<jats:p> Let [Formula: see text] be a set of [Formula: see text] spanning trees in a graph [Formula: see text]. The [Formula: see text] spanning trees are called completely independent spanning trees (CISTs for short) if the paths joining every pair of vertices [Formula: see text] and [Formula: see text] in any two trees have neither vertex nor edge in common except for [Formula: see text] and [Formula: see text]. Particularly, [Formula: see text] is called a dual-CIST provided [Formula: see text]. For data transmission applications in reliable networks, the existence of a dual-CIST can provide a configuration of fault-tolerant routing called protection routing. This paper investigates the problem of constructing a dual-CIST in the [Formula: see text]-dimensional hierarchical folded cubic network [Formula: see text]. The network is a two-level network using folded hypercube [Formula: see text] as clusters to reduce the diameter, hardware overhead and improve the fault tolerance ability. We propose a recursive algorithm to construct a dual-CIST of [Formula: see text] in [Formula: see text] time for [Formula: see text], where the time required is the same scale as the number of vertices of [Formula: see text]. Also, the diameter of each constructed CIST is [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s0129054123500156","type":"journal-article","created":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T04:51:51Z","timestamp":1693371111000},"page":"535-550","source":"Crossref","is-referenced-by-count":3,"title":["A Recursive Algorithm for Constructing Dual-CISTs in Hierarchical Folded Cubic Networks"],"prefix":"10.1142","volume":"35","author":[{"given":"Hsin-Jung","family":"Lin","sequence":"first","affiliation":[{"name":"Institute of Information and Decision Sciences, National Taipei University of Business, Taipei 10051, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5520-2169","authenticated-orcid":false,"given":"Shyue-Ming","family":"Tang","sequence":"additional","affiliation":[{"name":"Department of Psychology and Social Work, National Defense University, Taipei 11258, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5131-573X","authenticated-orcid":false,"given":"Kung-Jui","family":"Pai","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering and Management, Ming Chi University of Technology, New Taipei City 243303, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9542-7968","authenticated-orcid":false,"given":"Jou-Ming","family":"Chang","sequence":"additional","affiliation":[{"name":"Institute of Information and Decision Sciences, National Taipei University of Business, Taipei 10051, Taiwan"}]}],"member":"219","published-online":{"date-parts":[[2023,8,29]]},"reference":[{"key":"S0129054123500156BIB001","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxr137"},{"key":"S0129054123500156BIB002","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxs171"},{"key":"S0129054123500156BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.12.023"},{"key":"S0129054123500156BIB004","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3029654"},{"key":"S0129054123500156BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.05.031"},{"key":"S0129054123500156BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.11.019"},{"key":"S0129054123500156BIB007","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3080315"},{"key":"S0129054123500156BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/1383-7621(96)00019-7"},{"key":"S0129054123500156BIB009","doi-asserted-by":"publisher","DOI":"10.1109\/12.53600"},{"key":"S0129054123500156BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(91)90131-R"},{"key":"S0129054123500156BIB011","doi-asserted-by":"publisher","DOI":"10.1109\/71.395400"},{"key":"S0129054123500156BIB012","doi-asserted-by":"publisher","DOI":"10.1109\/71.80187"},{"key":"S0129054123500156BIB013","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-001-1021-7"},{"key":"S0129054123500156BIB014","doi-asserted-by":"publisher","DOI":"10.1002\/net.10101"},{"key":"S0129054123500156BIB015","doi-asserted-by":"publisher","DOI":"10.1002\/net.10040"},{"key":"S0129054123500156BIB016","doi-asserted-by":"publisher","DOI":"10.1109\/71.372797"},{"key":"S0129054123500156BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00377-0"},{"key":"S0129054123500156BIB018","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36379-3_21"},{"key":"S0129054123500156BIB020","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2123916"},{"key":"S0129054123500156BIB021","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.07.021"},{"key":"S0129054123500156BIB022","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3133595"},{"key":"S0129054123500156BIB023","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2022.3147320"},{"key":"S0129054123500156BIB024","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.04.028"},{"key":"S0129054123500156BIB025","doi-asserted-by":"publisher","DOI":"10.1109\/71.262585"},{"key":"S0129054123500156BIB026","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2018.08.006"},{"first-page":"63","volume-title":"Proceedings of 10th IEEE International Workshop on Selected Topics in Mobile and Wireless Computing","author":"Moinet A.","key":"S0129054123500156BIB027"},{"key":"S0129054123500156BIB028","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.08.024"},{"key":"S0129054123500156BIB029","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2910019"},{"key":"S0129054123500156BIB030","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2020.02.007"},{"key":"S0129054123500156BIB031","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-020-03297-9"},{"key":"S0129054123500156BIB032","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.03.035"},{"key":"S0129054123500156BIB033","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.05.048"},{"key":"S0129054123500156BIB034","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2022.3140329"},{"key":"S0129054123500156BIB035","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.11.015"},{"key":"S0129054123500156BIB036","first-page":"124546","volume":"362","author":"Qin X.-W.","year":"2019","journal-title":"Appl. Math. Comput."},{"key":"S0129054123500156BIB037","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2020.125900"},{"key":"S0129054123500156BIB038","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2931904"},{"key":"S0129054123500156BIB039","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2004.05.003"},{"key":"S0129054123500156BIB040","first-page":"134","volume-title":"Proceedings of the 4th International Conference, Exhibition on High Performance Computing in the Asia-Pacific Region1","volume":"1","author":"Shi Y.","year":"2000"},{"key":"S0129054123500156BIB041","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.04.022"},{"key":"S0129054123500156BIB042","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.06.001"},{"key":"S0129054123500156BIB043","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-012-0455-y"},{"issue":"4","key":"S0129054123500156BIB044","first-page":"436","volume":"78","author":"Yun S. K.","year":"1995","journal-title":"IEICE Trans. Inform. Syst."},{"key":"S0129054123500156BIB045","doi-asserted-by":"publisher","DOI":"10.1109\/71.667900"},{"key":"S0129054123500156BIB046","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.09.026"},{"key":"S0129054123500156BIB047","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.10.030"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054123500156","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,9]],"date-time":"2024-07-09T03:05:49Z","timestamp":1720494349000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054123500156"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,29]]},"references-count":46,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["10.1142\/S0129054123500156"],"URL":"https:\/\/doi.org\/10.1142\/s0129054123500156","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2023,8,29]]}}}