{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T21:52:13Z","timestamp":1768341133194,"version":"3.49.0"},"reference-count":28,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2024,9,1]]},"DOI":"10.1587\/transinf.2024edp7040","type":"journal-article","created":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T22:19:13Z","timestamp":1725142753000},"page":"1133-1139","source":"Crossref","is-referenced-by-count":1,"title":["Node-to-Node and Node-to-Set Disjoint Paths Problems in Bicubes"],"prefix":"10.1587","volume":"E107.D","author":[{"given":"Arata","family":"KANEKO","sequence":"first","affiliation":[{"name":"Graduate School of Engineering, Tokyo University of Agriculture and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Htoo Htoo Sandi","family":"KYAW","sequence":"additional","affiliation":[{"name":"Graduate School of Engineering, Tokyo University of Agriculture and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunihiro","family":"FUJIYOSHI","sequence":"additional","affiliation":[{"name":"Graduate School of Engineering, Tokyo University of Agriculture and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keiichi","family":"KANEKO","sequence":"additional","affiliation":[{"name":"Graduate School of Engineering, Tokyo University of Agriculture and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] C.L. Seitz, \u201cThe cosmic cube,\u201d Communications of the ACM, vol.28, no.1, pp.22-33, Jan. 1985. 10.1145\/2465.2467","DOI":"10.1145\/2465.2467"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] H.-S. Lim, J.-H. Park, and H.-C. Kim, \u201cThe bicube: An interconnection of two hypercubes,\u201d International Journal of Computer Mathematics, vol.92, no.1, pp.29-40, Jan. 2015. 10.1080\/00207160.2014.890715","DOI":"10.1080\/00207160.2014.890715"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] M. Okada and K. Kaneko, \u201cMinimal paths in a bicube,\u201d IEICE Trans. Inf. &amp; Syst., vol.E105-D, no.8, pp.1383-1392, Aug. 2022. 10.1587\/transinf.2021edp7235","DOI":"10.1587\/transinf.2021EDP7235"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] H. Zhuang, W. Guo, X.-Y. Li, X. Liu, and C.-K. Lin, \u201cThe component connectivity, component diagnosability, and t\/k-diagnosability of bicube networks,\u201d Theoretical Computer Science, vol.896, pp.145-157, 2021. 10.1016\/j.tcs.2021.10.011","DOI":"10.1016\/j.tcs.2021.10.011"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] Y.-H. Chen, S.-M. Tang, K.-J. Pai, and J.-M. Chang, \u201cConstructing dual-cists with short diameters using a generic adjustment scheme on bicubes,\u201d Theoretical Computer Science, vol.878-879, pp.102-112, 2021. 10.1016\/j.tcs.2021.05.031","DOI":"10.1016\/j.tcs.2021.05.031"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] J. Liu, S. Zhou, E. Cheng, G. Chen, and M. Li, \u201cReliability evaluation of bicube-based multiprocessor system under the g-good-neighbor restriction,\u201d Parallel Processing Letters, vol.31, no.04, 2150018, 2021. 10.1142\/s0129626421500183","DOI":"10.1142\/S0129626421500183"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] J. Liu, S. Zhou, Z. Gu, Q. Zhou, and D. Wang, \u201cFault diagnosability of bicube networks under the PMC diagnostic model,\u201d Theoretical Computer Science, vol.851, pp.14-23, 2021. 10.1016\/j.tcs.2020.09.012","DOI":"10.1016\/j.tcs.2020.09.012"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] K. Kaneko, \u201cNode-disjoint paths problems in directed bijective connection graphs,\u201d IEICE Trans. Inf. &amp; Syst., vol.E103-D, pp.93-100, Jan. 2020. 10.1587\/transinf.2019edp7197","DOI":"10.1587\/transinf.2019EDP7197"},{"key":"9","unstructured":"[9] A. Bossard and K. Kaneko, \u201cTime optimal node-to-set disjoint paths routing in hypercubes,\u201d Journal of Information Science and Engineering, vol.30, pp.1087-1093, July 2014."},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] X. Yang, D.J. Evans, and G.M. Megson, \u201cThe locally twisted cubes,\u201d International Journal of Computer Mathematics, vol.82, no.4, pp.401-413, April 2005. 10.1080\/0020716042000301752","DOI":"10.1080\/0020716042000301752"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] Y. Saad and M.H. Schultz, \u201cTopological properties of hypercubes,\u201d IEEE Trans. Comput., vol.37, no.7, pp.867-872, July 1988. 10.1109\/12.2234","DOI":"10.1109\/12.2234"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] P.D. Kulasinghe, \u201cConnectivity of the crossed cube,\u201d Information Processing Letters, vol.61, no.4, pp.221-226, Feb. 1997. 10.1016\/s0020-0190(97)00012-4","DOI":"10.1016\/S0020-0190(97)00012-4"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] C.-P. Chang, J.-N. Wang, and L.-H. Hsu, \u201cTopological properties of twisted cube,\u201d Information Sciences, vol.113, no.1-2, pp.147-167, Jan. 1999. 10.1016\/s0020-0255(98)10045-2","DOI":"10.1016\/S0020-0255(98)10045-2"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] Y.-K. Shih and S.-S. Kao, \u201cOne-to-one disjoint path covers on <i>k<\/i>-ary <i>n<\/i>-cubes,\u201d Theoretical Computer Science, vol.412, no.35, pp.4513-4530, Aug. 2011. 10.1016\/j.tcs.2011.04.035","DOI":"10.1016\/j.tcs.2011.04.035"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] D. Koc\u00edk and K. Kaneko, \u201cNode-to-node disjoint paths problem in a M\u00f6bius cube,\u201d IEICE Trans. Inf. &amp; Syst., vol.E100-D, no.8, pp.1837-1843, Aug. 2017. 10.1587\/transinf.2016edp7475","DOI":"10.1587\/transinf.2016EDP7475"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] H. Nagashima, K. Mouri, and K. Kaneko, \u201cNode-to-node disjoint paths in twisted crossed cubes,\u201d Proc. 10th International Conference on Advances in Information Technology, pp.5:1-5:8, Dec. 2018. 10.1145\/3291280.3291785","DOI":"10.1145\/3291280.3291785"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] Q.-P. Gu and S. Peng, \u201cNode-to-set disjoint paths problem in star graphs,\u201d Information Processing Letters, vol.62, no.4, pp.201-207, April 1997. 10.1016\/s0020-0190(97)00059-8","DOI":"10.1016\/S0020-0190(97)00059-8"},{"key":"18","unstructured":"[18] Q.-P. Gu, S. Okawa, and S. Peng, \u201cSet-to-set fault tolerant routing in hypercudes,\u201d IEICE Trans. Fundamentals, vol.E79-A, pp.483-488, April 1996."},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] C.-N. Lai, G.-H. Chen, and D.-R. Duh, \u201cConstructing one-to-many disjoint paths in folded hypercubes,\u201d IEEE Trans. Comput., vol.51, no.1, pp.33-45, Jan. 2002. 10.1109\/12.980015","DOI":"10.1109\/12.980015"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] K. Kaneko, \u201cAn algorithm for node-to-set disjoint paths problem in bi-rotator graphs,\u201d IEICE Trans. Inf. &amp; Syst., vol.E89-D, no.2, pp.647-653, Feb. 2006. 10.1093\/ietisy\/e89-d.2.647","DOI":"10.1093\/ietisy\/e89-d.2.647"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] Y. Suzuki, K. Kaneko, and M. Nakamori, \u201cNode-disjoint paths algorithm in a transposition graph,\u201d IEICE Trans. Inf. &amp; Syst., vol.E89-D, no.10, pp.2600-2605, Oct. 2006. 10.1093\/ietisy\/e89-d.10.2600","DOI":"10.1093\/ietisy\/e89-d.10.2600"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] D. Koc\u00edk, Y. Hirai, and K. Kaneko, \u201cNode-to-set disjoint paths problem in a M\u00f6bius cube,\u201d IEICE Trans. Inf. &amp; Syst., vol.E99-D, no.3, pp.708-713, March 2016. 10.1587\/transinf.2015edp7331","DOI":"10.1587\/transinf.2015EDP7331"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] D. Choi and I. Chung, \u201cA nearly optimal one-to-many routing algorithm on k-ary n-cube networks,\u201d Smart Media Journal, vol.7, no.2, pp.9-14, May 2018. 10.30693\/smj.2018.7.2.9","DOI":"10.30693\/SMJ.2018.7.2.9"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] X.-B. Chen, \u201cMany-to-many disjoint paths in faulty hypercubes,\u201d Information Sciences, vol.179, no.18, pp.3110-3115, Aug. 2009. 10.1016\/j.ins.2009.05.006","DOI":"10.1016\/j.ins.2009.05.006"},{"key":"25","doi-asserted-by":"publisher","unstructured":"[25] X.-J. Li, B. Liu, M. Ma, and J.-M. Xu, \u201cMany-to-many disjoint paths in hypercubes with faulty vertices,\u201d Discrete Applied Mathematics, vol.217, pp.229-242, Jan. 2017. 10.1016\/j.dam.2016.09.013","DOI":"10.1016\/j.dam.2016.09.013"},{"key":"26","doi-asserted-by":"publisher","unstructured":"[26] J. Li, C. Melekian, S. Zuo, and E. Cheng, \u201cUnpaired many-to-many disjoint path covers on bipartite <i>k<\/i>-ary <i>n<\/i>-cube networks with faulty elements,\u201d International Journal of Foundations of Computer Science, vol.31, no.03, pp.371-383, 2020. 10.1142\/s0129054120500148","DOI":"10.1142\/S0129054120500148"},{"key":"27","doi-asserted-by":"publisher","unstructured":"[27] H. Ichida and K. Kaneko, \u201cSet-to-set disjoint paths problem in M\u00f6bius cubes,\u201d IEEE Access, vol.10, pp.83075-83084, 2022. 10.1109\/access.2022.3197288","DOI":"10.1109\/ACCESS.2022.3197288"},{"key":"28","doi-asserted-by":"publisher","unstructured":"[28] K. Kaneko, A. Bossard, and F.C. Harris, Jr., \u201cSet-to-set disjoint path routing in bijective connection graphs,\u201d IEEE Access, vol.10, pp.72731-72742, 2022. 10.1109\/access.2022.3188783","DOI":"10.1109\/ACCESS.2022.3188783"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E107.D\/9\/E107.D_2024EDP7040\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T04:22:07Z","timestamp":1725682927000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E107.D\/9\/E107.D_2024EDP7040\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,1]]},"references-count":28,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2024]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2024edp7040","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,1]]},"article-number":"2024EDP7040"}}