{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T05:23:20Z","timestamp":1725686600290},"reference-count":15,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2020,1,1]]},"DOI":"10.1587\/transinf.2019edp7197","type":"journal-article","created":{"date-parts":[[2019,12,31]],"date-time":"2019-12-31T17:06:47Z","timestamp":1577812007000},"page":"93-100","source":"Crossref","is-referenced-by-count":2,"title":["Node-Disjoint Paths Problems in Directed Bijective Connection Graphs"],"prefix":"10.1587","volume":"E103.D","author":[{"given":"Keiichi","family":"KANEKO","sequence":"first","affiliation":[{"name":"Institute of Engineering, Tokyo University of Agriculture and Technology"}]}],"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":"crossref","unstructured":"[2] 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, UK, pp.152-159, Springer-Verlag, 1987. 10.1007\/3-540-17943-7_126","DOI":"10.1007\/3-540-17943-7_126"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] 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":"4","doi-asserted-by":"publisher","unstructured":"[4] 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":"5","doi-asserted-by":"publisher","unstructured":"[5] 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":"6","doi-asserted-by":"publisher","unstructured":"[6] W.J. Zhou, J.X. Fan, X.H. Jia, and S.K. 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":"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] J. Fan and X. Jia, \u201cEdge-pancyclicity and path-embeddability of bijective connection graphs,\u201d Information Sciences, vol.178, no.2, pp.340-351, 2008. 10.1016\/j.ins.2007.08.012","DOI":"10.1016\/j.ins.2007.08.012"},{"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, no.4, pp.1087-1093, July 2014."},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] 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":"11","doi-asserted-by":"publisher","unstructured":"[11] D. Koc\u00edk, Y. Hirai, and K. Kaneko, \u201cNode-to-set disjoint paths problem in a M\u00f6bius cube,\u201d IEICE Trans. Inf. & Syst., vol.E99-D, no.3, pp.708-713, March 2016. 10.1587\/transinf.2015edp7331","DOI":"10.1587\/transinf.2015EDP7331"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] D. Koc\u00edk and K. Kaneko, \u201cNode-to-node disjoint paths problem in M\u00f6bius cube,\u201d IEICE Trans. Inf. & Syst., vol.E100-D, no.8, pp.1837-1843, Aug. 2017. 10.1587\/transinf.2016edp7475","DOI":"10.1587\/transinf.2016EDP7475"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] 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":"14","doi-asserted-by":"publisher","unstructured":"[14] 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":"15","doi-asserted-by":"crossref","unstructured":"[15] 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"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/1\/E103.D_2019EDP7197\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T00:20:24Z","timestamp":1578270024000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/1\/E103.D_2019EDP7197\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2019edp7197","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,1]]}}}