{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T19:46:29Z","timestamp":1778183189422,"version":"3.51.4"},"reference-count":30,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172291"],"award-info":[{"award-number":["62172291"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272333"],"award-info":[{"award-number":["62272333"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:p> The existence of multiple edge-disjoint Hamiltonian cycles (EDHCs for short) is a desirable property of interconnection networks. These parallel cycles can provide an advantage for algorithms that require a ring structure. Additionally, EDHCs can enhance all-to-all data broadcasting and edge fault tolerance in network communications. In this paper, we investigate the construction of EDHCs in the balanced hypercube, which is a variant of the hypercube with many attractive properties, such as strong connectivity, regularity, and symmetry. In particular, each processor in the balanced hypercube has a backup processor that shares the common neighbors, enabling fault tolerance and efficient system reconfiguration. In 2019, L\u00fc et al. provided an algorithm to construct two EDHCs in an [Formula: see text]-dimensional balanced hypercube [Formula: see text] for [Formula: see text]. We further study this topic and give some construction schemes to construct [Formula: see text] EDHCs in [Formula: see text] for [Formula: see text]. Since [Formula: see text] is [Formula: see text]-regular, our result is optimal for [Formula: see text] ([Formula: see text]). In addition, we simulate the fault-tolerant data broadcasting through these parallel cycles as transmission channels. <\/jats:p>","DOI":"10.1142\/s0129054124500047","type":"journal-article","created":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T08:56:06Z","timestamp":1713430566000},"page":"1-24","source":"Crossref","is-referenced-by-count":2,"title":["Edge-Disjoint Hamiltonian Cycles in Balanced Hypercubes with Applications to Fault-Tolerant Data Broadcasting"],"prefix":"10.1142","volume":"36","author":[{"given":"Shuai","family":"Liu","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, Suzhou 215006, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1409-8478","authenticated-orcid":false,"given":"Yan","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, Suzhou 215006, P. R. China"}]},{"given":"Jianxi","family":"Fan","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, Suzhou 215006, P. R. China"}]},{"given":"Baolei","family":"Cheng","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, Suzhou 215006, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2024,4,18]]},"reference":[{"key":"S0129054124500047BIB001","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2409843"},{"key":"S0129054124500047BIB002","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2003.1234525"},{"key":"S0129054124500047BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00087-5"},{"key":"S0129054124500047BIB004","doi-asserted-by":"publisher","DOI":"10.1109\/12.403718"},{"key":"S0129054124500047BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2019.02.033"},{"key":"S0129054124500047BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2021.08.036"},{"key":"S0129054124500047BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.05.004"},{"issue":"1","key":"S0129054124500047BIB008","first-page":"42","volume":"39","author":"Hung R.-W.","year":"2012","journal-title":"IAENG International Journal of Computer Science"},{"key":"S0129054124500047BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.09.006"},{"issue":"1","key":"S0129054124500047BIB010","first-page":"362","volume":"2195","author":"Hung R.-W.","year":"2012","journal-title":"Proceedings of the International MultiConference of Engineers and Computer Scientists"},{"key":"S0129054124500047BIB011","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.192"},{"key":"S0129054124500047BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2015.08.003"},{"key":"S0129054124500047BIB013","doi-asserted-by":"publisher","DOI":"10.1109\/71.282556"},{"key":"S0129054124500047BIB014","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2389847"},{"key":"S0129054124500047BIB015","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3133595"},{"key":"S0129054124500047BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.08.017"},{"key":"S0129054124500047BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2018.12.004"},{"key":"S0129054124500047BIB018","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-89543-3_31"},{"key":"S0129054124500047BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.05.048"},{"key":"S0129054124500047BIB020","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-022-04825-5"},{"key":"S0129054124500047BIB021","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2022.3140329"},{"key":"S0129054124500047BIB022","doi-asserted-by":"publisher","DOI":"10.1109\/DMCC.1991.633359"},{"key":"S0129054124500047BIB023","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-018-1826-3"},{"key":"S0129054124500047BIB024","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxab120"},{"key":"S0129054124500047BIB025","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.12.011"},{"key":"S0129054124500047BIB026","doi-asserted-by":"publisher","DOI":"10.1109\/12.588063"},{"key":"S0129054124500047BIB027","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-020-03419-3"},{"key":"S0129054124500047BIB028","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.10.021"},{"key":"S0129054124500047BIB029","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.141"},{"key":"S0129054124500047BIB030","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2014.2304391"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054124500047","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T07:19:01Z","timestamp":1738653541000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054124500047"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,18]]},"references-count":30,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["10.1142\/S0129054124500047"],"URL":"https:\/\/doi.org\/10.1142\/s0129054124500047","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,18]]}}}