{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T17:26:12Z","timestamp":1775323572935,"version":"3.50.1"},"reference-count":31,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2024,1,1]]},"DOI":"10.1587\/transinf.2023edp7067","type":"journal-article","created":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T22:39:15Z","timestamp":1704062355000},"page":"53-59","source":"Crossref","is-referenced-by-count":4,"title":["Node-to-Set Disjoint Paths Problem in Cross-Cubes"],"prefix":"10.1587","volume":"E107.D","author":[{"given":"Rikuya","family":"SASAKI","sequence":"first","affiliation":[{"name":"Graduate School of Engineering, Tokyo University of Agriculture and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"ICHIDA","sequence":"additional","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":"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] P. Cull and S.M. Larson, \u201cThe M\u00f6bius cubes,\u201d IEEE Trans. Comput., vol.44, no.5, pp.647-659, May 1995. 10.1109\/12.381950","DOI":"10.1109\/12.381950"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] K. Efe, \u201cThe crossed cube architecture for parallel computation,\u201d IEEE Trans. Parallel Distrib. Syst., vol.3, no.5, pp.513-524, Sept. 1992. 10.1109\/71.159036","DOI":"10.1109\/71.159036"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] E. Haq, \u201cCross-cube: a new fault tolerant hypercube-based network,\u201d Proc. Fifth International Parallel Processing Symposium, pp.471-474, 1991. 10.1109\/ipps.1991.153821","DOI":"10.1109\/IPPS.1991.153821"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] P.A.J. Hilbers, M.R.J. Koopman, and J.L.A. van de Snepscheut, \u201cThe twisted cube,\u201d Volume I: Parallel Architectures on PARLE: Parallel Architectures and Languages Europe, London, UK, pp.152-159, Springer-Verlag, 1987. 10.1007\/3-540-17943-7_126","DOI":"10.1007\/3-540-17943-7_126"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] 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":"6","doi-asserted-by":"publisher","unstructured":"[6] 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":"7","doi-asserted-by":"publisher","unstructured":"[7] X. Wang, J. Liang, D. Qi, and W. Lin, \u201cThe twisted crossed cube,\u201d Concurrency and Computation: Practice and Experience, vol.28, no.5, pp.1507-1526, 2016. 10.1002\/cpe.3707","DOI":"10.1002\/cpe.3707"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] 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":"9","doi-asserted-by":"publisher","unstructured":"[9] W. Zhou, J. Fan, X. Jia, and S. Zhang, \u201cThe spined cube: a new hypercube variant with smaller diameter,\u201d Information Processing Letters, vol.111, no.12, pp.561-567, June 2011. 10.1016\/j.ipl.2011.03.011","DOI":"10.1016\/j.ipl.2011.03.011"},{"key":"10","unstructured":"[10] A. Bossard and K. Kaneko, \u201cA node-to-set disjoint paths routing algorithm in torus-connected cycles,\u201d ISCA International Journal of Computers and their Applications, vol.22, no.1, pp.22-30, Jan. 2015."},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] 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":"12","unstructured":"[12] K. Kaneko and Y. Suzuki, \u201cAn algorithm for node-to-set disjoint paths problem in rotator graphs,\u201d IEICE Trans. Inf. &amp; Syst., vol.E84-D, no.9, pp.1155-1163, Sept. 2001."},{"key":"13","unstructured":"[13] K. Kaneko, \u201cAn algorithm for node-to-set disjoint paths problem in burnt pancake graphs,\u201d IEICE Trans. Inf. &amp; Syst., vol.E86-D, no.12, pp.2588-2594, Dec. 2003."},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] 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":"15","doi-asserted-by":"publisher","unstructured":"[15] C.-N. Lai, \u201cAn efficient construction of one-to-many node-disjoint paths in folded hypercubes,\u201d Journal of Parallel and Distributed Computing, vol.74, no.4, pp.2310-2316, April 2014. 10.1016\/j.jpdc.2013.12.005","DOI":"10.1016\/j.jpdc.2013.12.005"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] 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":"17","doi-asserted-by":"publisher","unstructured":"[17] L. Lipt\u00e1k, E. Cheng, J.-S. Kim, and S.W. Kim, \u201cOne-to-many node-disjoint paths of hyper-star networks,\u201d Discrete Applied Mathematics, vol.160, no.13-14, pp.2006-2014, Sept. 2012. 10.1016\/j.dam.2012.04.006","DOI":"10.1016\/j.dam.2012.04.006"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] K. Kaneko and N. Sawada, \u201cAn algorithm for node-to-node disjoint paths problem in burnt pancake graphs,\u201d IEICE Trans. Inf. &amp; Syst., vol.E90-D, no.1, pp.306-313, Jan. 2007. 10.1093\/ietisy\/e90-1.1.306","DOI":"10.1093\/ietisy\/e90-1.1.306"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] D. Koc\u00edk and K. Kaneko, \u201cNode-to-node disjoint paths problem in a M\u00f6bius cubes,\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":"20","doi-asserted-by":"publisher","unstructured":"[20] T.-C. Lin and D.-R. Duh, \u201cConstructing vertex-disjoint paths in (<i>n<\/i>, <i>k<\/i>)-star graphs,\u201d Information Sciences, vol.178, no.3, pp.788-801, Feb. 2008. 10.1016\/j.ins.2007.09.014","DOI":"10.1016\/j.ins.2007.09.014"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] Y. Li, S. Peng, and W. Chu, \u201cDisjoint-paths and fault-tolerant routing on recursive dual-net,\u201d International Journal of Foundations of Computer Science, vol.22, no.5, pp.1001-1018, Aug. 2011. 10.1142\/s0129054111008532","DOI":"10.1142\/S0129054111008532"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] Y. Suzuki and K. Kaneko, \u201cThe container problem in bubble-sort graphs,\u201d IEICE Trans. Inf. &amp; Syst., vol.E91-D, no.4, pp.1003-1009, April 2008. 10.1093\/ietisy\/e91-d.4.1003","DOI":"10.1093\/ietisy\/e91-d.4.1003"},{"key":"23","unstructured":"[23] A. Bossard, \u201cA set-to-set disjoint paths routing algorithm in hyper-star graphs,\u201d ISCA International Journal of Computers and Their Applications, vol.21, no.1, pp.76-82, March 2014."},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] A. Bossard and K. Kaneko, \u201cThe set-to-set disjoint-path problem in perfect hierarchical hypercubes,\u201d The Computer Journal, vol.55, no.6, pp.769-775, June 2012. 10.1093\/comjnl\/bxr135","DOI":"10.1093\/comjnl\/bxr135"},{"key":"25","unstructured":"[25] A. Bossard and K. Kaneko, \u201cTime optimal node-to-set disjoint paths routing in hypercubes,\u201d Journal of Information Science and Engineering, vol.30, no.4, pp.1087-1093, July 2014."},{"key":"26","doi-asserted-by":"publisher","unstructured":"[26] 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":"27","unstructured":"[27] Q.P. Gu, S. Okawa, and S. Peng, \u201cSet-to-set fault tolerant routing in hypercudes,\u201d IEICE Trans. Fundamentals, vol.E79-A, no.4, pp.483-488, April 1996."},{"key":"28","unstructured":"[28] Q.P. Gu and S. Peng, \u201cSet-to-set fault tolerant routing in star graphs,\u201d IEICE Trans. Inf. &amp; Syst., vol.E79-D, no.4, pp.282-289, April 1996."},{"key":"29","doi-asserted-by":"publisher","unstructured":"[29] X. Wang, J. Fan, S. Zhang, and J. Yu, \u201cNode-to-set disjoint paths problem in cross-cubes,\u201d Journal of Supercomputing, vol.78, no.1, pp.1356-1380, Jan. 2022. 10.1007\/s11227-021-03872-8","DOI":"10.1007\/s11227-021-03872-8"},{"key":"30","doi-asserted-by":"publisher","unstructured":"[30] K. Menger, \u201cZur allgemeinen Kurventhoerie,\u201d Fundamenta Mathematicae, vol.10, pp.96-115, 1927. 10.4064\/fm-10-1-96-115","DOI":"10.4064\/fm-10-1-96-115"},{"key":"31","doi-asserted-by":"crossref","unstructured":"[31] L.R. Ford, Jr. and D.R. Fulkerson, \u201cMaximal flow through a network,\u201d Canadian Journal of Mathematics, vol.8, pp.399-404, 1956. 10.4153\/cjm-1956-045-5","DOI":"10.4153\/CJM-1956-045-5"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E107.D\/1\/E107.D_2023EDP7067\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T05:15:12Z","timestamp":1730956512000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E107.D\/1\/E107.D_2023EDP7067\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,1]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2023edp7067","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,1]]},"article-number":"2023EDP7067"}}