{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T03:52:18Z","timestamp":1768362738638,"version":"3.49.0"},"reference-count":59,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Grant-in-Aid for Scientific Research (C) of the Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["20K11729"],"award-info":[{"award-number":["20K11729"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Grant-in-Aid for Scientific Research (C) of the Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["19K11887"],"award-info":[{"award-number":["19K11887"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3188783","type":"journal-article","created":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T19:29:42Z","timestamp":1657135782000},"page":"72731-72742","source":"Crossref","is-referenced-by-count":4,"title":["Set-to-Set Disjoint Path Routing in Bijective Connection Graphs"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1790-4615","authenticated-orcid":false,"given":"Keiichi","family":"Kaneko","sequence":"first","affiliation":[{"name":"Institute of Engineering, Tokyo University of Agriculture and Technology, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9381-9346","authenticated-orcid":false,"given":"Antoine","family":"Bossard","sequence":"additional","affiliation":[{"name":"Graduate School of Science, Kanagawa University, Hiratsuka, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0857-6931","authenticated-orcid":false,"given":"Frederick C.","family":"Harris","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Nevada, Reno, Reno, NV, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2465.2467"},{"issue":"1","key":"ref2","first-page":"84","article-title":"BC interconnection networks and their properties (in Chinese)","volume":"26","author":"Fan","year":"2003","journal-title":"Chin. J. Comput."},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-17943-7_126"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/71.159036"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/12.381950"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/0020716042000301752"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.03.011"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.3707"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.08.012"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.02.014"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.03.125"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.3390\/math7060546"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.2019EDP7197"},{"issue":"1","key":"ref14","first-page":"76","article-title":"A set-to-set disjoint paths routing algorithm in hyper-star graphs","volume":"21","author":"Bossard","year":"2014","journal-title":"ISCA Int. J. Comput. Their Appl."},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxr135"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxs171"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.05.006"},{"issue":"4","key":"ref18","first-page":"483","article-title":"Set-to-set fault tolerant routing in hypercudes","volume":"79","author":"Gu","year":"1996","journal-title":"IEICE Trans. Fundamentals Electron., Commun. Comput. Sci."},{"issue":"4","key":"ref19","first-page":"282","article-title":"Set-to-set fault tolerant routing in star graphs","volume":"79","author":"Gu","year":"1996","journal-title":"IEICE Trans. Inf. Syst."},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(98)00050-7"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.15803\/ijnc.7.2_173"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.09.013"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.15803\/ijnc.4.2_260"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/SPDP.1991.218213"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/net.10040"},{"issue":"4","key":"ref26","first-page":"477","article-title":"Nonadaptive fault-tolerant file transmission in rotator graphs","volume":"79","author":"Hamada","year":"1996","journal-title":"IEICE Trans. Fundamentals"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1093\/ietisy\/e90-1.1.306"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.2016EDP7475"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.09.014"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054111008532"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/SPDP.1990.143599"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.04.035"},{"issue":"3","key":"ref33","first-page":"610","article-title":"An algorithm for node-disjoint paths in pancake graphs","volume":"86","author":"Suzuki","year":"2003","journal-title":"IEICE Trans. Inf. Syst."},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1093\/ietisy\/e91-d.4.1003"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.02.035"},{"issue":"1","key":"ref36","first-page":"22","article-title":"A node-to-set disjoint paths routing algorithm in torus-connected cycles","volume":"22","author":"Bossard","year":"2015","journal-title":"ISCA Int. J. Comput. their Appl."},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00059-8"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1093\/ietisy\/e89-d.2.647"},{"issue":"12","key":"ref39","first-page":"2588","article-title":"An algorithm for node-to-set disjoint paths problem in burnt pancake graphs","volume":"86","author":"Kaneko","year":"2003","journal-title":"IEICE Trans. Inf. Syst."},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.2015EDP7331"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2013.12.005"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/12.980015"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.04.006"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.15803\/ijnc.1.2_178"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2009.08.013"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/12.2234"},{"issue":"4","key":"ref47","first-page":"1087","article-title":"Time optimal node-to-set disjoint paths routing in hypercubes","volume":"30","author":"Bossard","year":"2014","journal-title":"J. Inf. Sci. Eng."},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(98)10045-2"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00012-4"},{"key":"ref50","first-page":"39","article-title":"An algorithm for set-to-set disjoint paths problem in a M\u00f6bius cube","volume-title":"Proc. 2017 Int. Conf. Parallel Distrib. Process. Techn. Appl.","author":"Kaneko"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3291280.3291785"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/358645.358660"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/s11786-015-0223-3"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3032684"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/71.372797"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.10.030"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-017-2033-7"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.06.001"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.12.032"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09815582.pdf?arnumber=9815582","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T04:21:00Z","timestamp":1706761260000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9815582\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":59,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3188783","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}