{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T04:31:13Z","timestamp":1749011473828,"version":"3.33.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,14]],"date-time":"2025-01-14T00:00:00Z","timestamp":1736812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,14]],"date-time":"2025-01-14T00:00:00Z","timestamp":1736812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the Qinglan Project of Jiangsu Province"},{"name":"Research Project of Suzhou Industrial Park Institute of Services Outsourcing","award":["SISO-ZD202202"],"award-info":[{"award-number":["SISO-ZD202202"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-024-06895-z","type":"journal-article","created":{"date-parts":[[2025,1,14]],"date-time":"2025-01-14T07:33:45Z","timestamp":1736840025000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Node-to-set disjoint paths problem in divide-and-swap cube"],"prefix":"10.1007","volume":"81","author":[{"given":"Yunsong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuejuan","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianfeng","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lantao","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,14]]},"reference":[{"issue":"7","key":"6895_CR1","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1093\/comjnl\/bxt034","volume":"57","author":"S Ling","year":"2014","unstructured":"Ling S, Chen W (2014) Node-to-set disjoint paths in biswapped networks. Comput J 57(7):953\u2013967","journal-title":"Comput J"},{"issue":"2","key":"6895_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s11464-009-0017-5","volume":"4","author":"J Xu","year":"2009","unstructured":"Xu J, Ma M (2009) Survey on path and cycle embedding in some networks. Front Math China 4(2):217\u2013252","journal-title":"Front Math China"},{"key":"6895_CR3","doi-asserted-by":"crossref","unstructured":"Han Y, Fan J, Yang J, Qian P (2009) Path embedding in faulty locally twisted cubes. In 2009 2nd IEEE International Conference on Computer Science and Information Technology. pp. 214\u2013218","DOI":"10.1109\/ICCSIT.2009.5234748"},{"key":"6895_CR4","first-page":"483","volume":"E79A","author":"Q Gu","year":"2014","unstructured":"Gu Q, Okawa S, Peng S (2014) Set-to-set fault tolerant routing in hypercubes. IEICE Trans Fundam E79A:483\u2013488","journal-title":"IEICE Trans Fundam"},{"issue":"4","key":"6895_CR5","first-page":"1087","volume":"30","author":"A Bossard","year":"2014","unstructured":"Bossard A, Kaneko K (2014) Time optimal node-to-set disjoint paths routing in hypercubes. J Inform Sci Eng 30(4):1087\u20131093","journal-title":"J Inform Sci Eng"},{"issue":"1","key":"6895_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/12.980015","volume":"51","author":"C Lai","year":"2002","unstructured":"Lai C, Chen G, Duh D (2002) Constructing one-to-many disjoint paths in folded hypercubes. IEEE Trans Comput 51(1):33\u201345","journal-title":"IEEE Trans Comput"},{"issue":"4","key":"6895_CR7","doi-asserted-by":"publisher","first-page":"2310","DOI":"10.1016\/j.jpdc.2013.12.005","volume":"74","author":"C Lai","year":"2014","unstructured":"Lai C (2014) An efficient construction of one-to-many node-disjoint paths in folded hypercubes. J Parallel Distrib Comput 74(4):2310\u20132316","journal-title":"J Parallel Distrib Comput"},{"issue":"1","key":"6895_CR8","doi-asserted-by":"publisher","first-page":"1356","DOI":"10.1007\/s11227-021-03872-8","volume":"78","author":"X Wang","year":"2022","unstructured":"Wang X, Fan J, Zhang S, Yu J (2022) Node-to-set disjoint paths problem in cross-cubes. J Supercomput 78(1):1356\u20131380","journal-title":"J Supercomput"},{"issue":"1","key":"6895_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1587\/transinf.2023EDP7067","volume":"E107D","author":"R Sasaki","year":"2024","unstructured":"Sasaki R, Ichida H, Kyaw HHS, Kaneko K (2024) Node-to-set disjoint paths problem in cross-cubes. IEICE Trans Inf Syst E107D(1):53\u201359","journal-title":"IEICE Trans Inf Syst"},{"issue":"9","key":"6895_CR10","doi-asserted-by":"publisher","first-page":"2467","DOI":"10.1109\/TC.2023.3251849","volume":"72","author":"W Fan","year":"2023","unstructured":"Fan W, Xiao F, Cai H, Chen X, Yu S (2023) Disjoint paths construction and fault-tolerant routing in BCube of data center networks. IEEE Trans Comput 72(9):2467\u20132481","journal-title":"IEEE Trans Comput"},{"issue":"4","key":"6895_CR11","first-page":"282","volume":"E79D","author":"Q Gu","year":"1996","unstructured":"Gu Q, Peng S (1996) Set-to-set fault tolerant routing in star graphs. IEICE Trans Inf Syst E79D(4):282\u2013289","journal-title":"IEICE Trans Inf Syst"},{"issue":"4","key":"6895_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0020-0190(97)00059-8","volume":"62","author":"Q Gu","year":"1997","unstructured":"Gu Q, Peng S (1997) Node-to-set disjoint paths problem in star graphs. Inf Process Lett 62(4):201\u2013207","journal-title":"Inf Process Lett"},{"issue":"1","key":"6895_CR13","first-page":"43","volume":"15","author":"Y Li","year":"2003","unstructured":"Li Y, Peng S, Chu W (2003) Disjoint paths in metacube. Proc IASTED Int Conf Parallel Distrib Comput Syst 15(1):43\u201350","journal-title":"Proc IASTED Int Conf Parallel Distrib Comput Syst"},{"key":"6895_CR14","doi-asserted-by":"crossref","unstructured":"Bossard A, Kaneko K, Peng S (2009) A Node-to-set disjoint-path routing algorithm in metacube. In Proceedings of the 2009 10th International Symposium on Pervasive Systems. pp. 23\u201328","DOI":"10.1109\/I-SPAN.2009.66"},{"key":"6895_CR15","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.jpdc.2016.05.001","volume":"96","author":"X Wang","year":"2016","unstructured":"Wang X, Fan J, Lin C-K, Jia X (2016) Vertex-disjoint paths in DCell networks. J Parallel Distrib Comput 96:38\u201344","journal-title":"J Parallel Distrib Comput"},{"issue":"1","key":"6895_CR16","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.tcs.2015.09.022","volume":"609","author":"X Wang","year":"2016","unstructured":"Wang X, Fan J, Jia X, Lin C-K (2016) An efficient algorithm to construct disjoint path covers of DCell networks. Theor Comput Sci 609(1):197\u2013210","journal-title":"Theor Comput Sci"},{"issue":"3","key":"6895_CR17","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1587\/transinf.2015EDP7331","volume":"99","author":"D Kocik","year":"2016","unstructured":"Kocik D, Hirai Y, Kaneko K (2016) Node-to-set disjoint paths problem in a M$$\\ddot{o}$$bius cube. IEICE Trans Inform Syst 99(3):708\u2013713","journal-title":"IEICE Trans Inform Syst"},{"issue":"8","key":"6895_CR18","doi-asserted-by":"publisher","first-page":"1837","DOI":"10.1587\/transinf.2016EDP7475","volume":"E100D","author":"D Kocik","year":"2017","unstructured":"Kocik D, Kaneko K (2017) Node-to-node disjoint paths problem in M$$\\ddot{o}$$bius cubes. IEICE Trans Inf Syst E100D(8):1837\u20131843","journal-title":"IEICE Trans Inf Syst"},{"issue":"4","key":"6895_CR19","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1093\/ietisy\/e91-d.4.1003","volume":"E91D","author":"Y Suzuki","year":"2008","unstructured":"Suzuki Y, Kaneko K (2008) The container problem in bubble-sort graphs. IEICE Trans Inf Syst E91D(4):1003\u20131009","journal-title":"IEICE Trans Inf Syst"},{"key":"6895_CR20","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.tcs.2014.09.041","volume":"562","author":"L You","year":"2015","unstructured":"You L, Fan J, Han Y, Jia X (2015) One-to-one disjoint path covers on alternating group graphs. Theor Comput Sci 562:146\u2013164","journal-title":"Theor Comput Sci"},{"key":"6895_CR21","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.tcs.2017.12.023","volume":"713","author":"L You","year":"2018","unstructured":"You L, Fan J, Han Y (2018) Super spanning connectivity on WK-recursive networks. Theor Comput Sci 713:42\u201355","journal-title":"Theor Comput Sci"},{"issue":"6","key":"6895_CR22","doi-asserted-by":"publisher","first-page":"1114","DOI":"10.1080\/00207160.2014.940334","volume":"92","author":"J Li","year":"2015","unstructured":"Li J, Liu D, Yang Y, Yuan J (2015) One-to-one disjoint path covers on multi-dimensional tori. Int J Comput Math 92(6):1114\u20131123","journal-title":"Int J Comput Math"},{"issue":"35","key":"6895_CR23","doi-asserted-by":"publisher","first-page":"4513","DOI":"10.1016\/j.tcs.2011.04.035","volume":"412","author":"Y Shih","year":"2011","unstructured":"Shih Y, Kao S (2011) One-to-one disjoint path covers on $$k$$-ary $$n$$-cubes. Theor Comput Sci 412(35):4513\u20134530","journal-title":"Theor Comput Sci"},{"issue":"7","key":"6895_CR24","doi-asserted-by":"publisher","first-page":"3621","DOI":"10.1007\/s11227-018-2712-z","volume":"75","author":"J-S Kim","year":"2019","unstructured":"Kim J-S, Kim DY, Qiu K, Lee H-O (2019) The divide-and-swap cube: a new hypercube variant with small network cost. J Supercomput 75(7):3621\u20133639","journal-title":"J Supercomput"},{"issue":"11","key":"6895_CR25","doi-asserted-by":"publisher","first-page":"2583","DOI":"10.3390\/math11112581","volume":"11","author":"L You","year":"2023","unstructured":"You L, Jiang J, Han Y (2023) Super spanning connectivity of the folded divide-and-swap cube. Mathematics 11(11):2583","journal-title":"Mathematics"},{"key":"6895_CR26","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.tcs.2021.05.033","volume":"880","author":"Q Zhou","year":"2021","unstructured":"Zhou Q, Zhou S, Liu J, Liu X (2021) Structure and substructure connectivity of divide-and-swap cube. Theor Comput Sci 880:20\u201336","journal-title":"Theor Comput Sci"},{"issue":"3","key":"6895_CR27","first-page":"183","volume":"9","author":"Y Zhang","year":"2024","unstructured":"Zhang Y, You L, Han Y, Xiao R (2024) One-to-one node disjoint paths on divide-and-swap cubes. Int J Comput Math: Comput Syst Theory 9(3):183\u2013201","journal-title":"Int J Comput Math: Comput Syst Theory"},{"key":"6895_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2020.06.017","volume":"842","author":"W Ning","year":"2020","unstructured":"Ning W (2020) Connectivity and super connectivity of the divide-and-swap cube. Theor Comput Sci 842:1\u20135","journal-title":"Theor Comput Sci"},{"issue":"1","key":"6895_CR29","doi-asserted-by":"publisher","first-page":"2142021","DOI":"10.1142\/S0219265921420214","volume":"22","author":"Q Zhou","year":"2022","unstructured":"Zhou Q, Zhou S, Liu X, Yu Z (2022) Reliability of divide-and-swap cube based on $$r$$-component connectivity and diagnosability. J Interconnect Netw 22(1):2142021","journal-title":"J Interconnect Netw"},{"key":"6895_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2022.12.005","volume":"943","author":"S Zhao","year":"2023","unstructured":"Zhao S, Chang J-M (2023) Reliability assessment of the divide-and-swap cube in terms of generalized connectivity. Theor Comput Sci 943:1\u201315","journal-title":"Theor Comput Sci"},{"key":"6895_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114834","volume":"1019","author":"Q Zhou","year":"2024","unstructured":"Zhou Q, Fan J, Wang Y, Cheng B, Wang G (2024) High fault-tolerant performance of the divide-and-swap cube network. Theor Comput Sci 1019:114834","journal-title":"Theor Comput Sci"},{"key":"6895_CR32","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2020.12.023","volume":"856","author":"Y-H Chang","year":"2021","unstructured":"Chang Y-H, Pai K-J, Hsu C-C, Yang J-S, Chang J-M (2021) Constructing dual-CISTs of folded divide-and-swap cubes. Theor Comput Sci 856:75\u201387","journal-title":"Theor Comput Sci"},{"key":"6895_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2023.106377","volume":"182","author":"S Zhao","year":"2023","unstructured":"Zhao S, Chang J-M (2023) Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes. Inf Process Lett 182:106377","journal-title":"Inf Process Lett"},{"key":"6895_CR34","doi-asserted-by":"publisher","DOI":"10.1201\/9781420044829","volume-title":"Graph theory and interconnection networks","author":"L-H Hsu","year":"2008","unstructured":"Hsu L-H, Lin C-K (2008) Graph theory and interconnection networks. CRC Press, Boca Raton"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06895-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06895-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06895-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,14]],"date-time":"2025-01-14T07:33:56Z","timestamp":1736840036000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06895-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,14]]},"references-count":34,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,1]]}},"alternative-id":["6895"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06895-z","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,14]]},"assertion":[{"value":"24 December 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"393"}}