{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:13:45Z","timestamp":1743074025055,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610921"},{"type":"electronic","value":"9789819610938"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-1093-8_25","type":"book-chapter","created":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:18:34Z","timestamp":1739999914000},"page":"300-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Construction Algorithm of\u00a0Vertex-Disjoint Paths in\u00a0Circulant-Based Recursive Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1522-8457","authenticated-orcid":false,"given":"Xiaoqing","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9577-8688","authenticated-orcid":false,"given":"Hai","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9479-8372","authenticated-orcid":false,"given":"Baolei","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1409-8478","authenticated-orcid":false,"given":"Yan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7055-5891","authenticated-orcid":false,"given":"Jianxi","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,20]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","unstructured":"Abu-Libdeh H., Costa P., Rowstron A., O$$^{\\prime }$$Shea G., Donnelly A.: Symbiotic routing in future data centers. In: Proceedings of the 10th ACM SIGCOMM conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, New Delhi, India, pp. 51\u201362 (2010). https:\/\/doi.org\/10.1145\/1851182.1851191.","DOI":"10.1145\/1851182.1851191."},{"issue":"2\/3","key":"25_CR2","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1147\/rd.492.0265","volume":"49","author":"NR Adiga","year":"2005","unstructured":"Adiga, N.R., et al.: Blue Cene\/L torus interconnection networks. IBM J. Res. Devlop. 49(2\/3), 265\u2013276 (2005). https:\/\/doi.org\/10.1147\/rd.492.0265","journal-title":"IBM J. Res. Devlop."},{"key":"25_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, New York (2008)"},{"key":"25_CR4","doi-asserted-by":"publisher","unstructured":"Chen K., Wen X., Ma X., Chen Y., Hu C., Dong Q.: WaveCube: a scalable, fault-tolerant, high-performance optical data center architecture. In: Proceedings of the 15th ACM SIGCOMM conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Kowloon, Hong Kong, pp. 1903\u20131911 (2015). https:\/\/doi.org\/10.1109\/INFOCOM.2015.7218573.","DOI":"10.1109\/INFOCOM.2015.7218573."},{"issue":"2","key":"25_CR5","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.jpdc.2006.04.004","volume":"67","author":"J Fan","year":"2007","unstructured":"Fan, J., Lin, X., Pan, Y., Jia, X.: Optimal fault-tolerant embedding of paths in twisted cubes. J. Parallel Distrib. Comput. 67(2), 205\u2013214 (2007). https:\/\/doi.org\/10.1016\/j.jpdc.2006.04.004","journal-title":"J. Parallel Distrib. Comput."},{"issue":"9","key":"25_CR6","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.: Disjoint paths construction and fault-tolerant routing in BCube of data center networks. IEEE Trans. Comput. 72(9), 2467\u20132481 (2023). https:\/\/doi.org\/10.1109\/TC.2023.3251849","journal-title":"IEEE Trans. Comput."},{"key":"25_CR7","doi-asserted-by":"publisher","unstructured":"Guo C., et al.: BCube: a high performance, server-centric network architecture for modular data centers. In: Proceedings of the 9th ACM SIGCOMM conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Barcelona, Spain, pp. 63\u201374 (2009). https:\/\/doi.org\/10.1145\/1594977.1592577.","DOI":"10.1145\/1594977.1592577."},{"key":"25_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2023.128262","volume":"459","author":"Y He","year":"2023","unstructured":"He, Y., Zhang, S., Chen, L., Yang, W.: The disjoint path cover in the data center network HSDC with prescribed vertices in each path. Appl. Math. Comput. 459, 128262 (2023). https:\/\/doi.org\/10.1016\/j.amc.2023.128262","journal-title":"Appl. Math. Comput."},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.tcs.2021.10.019","volume":"898","author":"W Kern","year":"2022","unstructured":"Kern, W., Martin, B., Paulusma, D., Smith, S., Leeuwen, E.J.: Disjoint paths and connected subgraphs for $$H$$-free graphs. Theor. Comput. Sci. 898, 59\u201368 (2022). https:\/\/doi.org\/10.1016\/j.tcs.2021.10.019","journal-title":"Theor. Comput. Sci."},{"key":"25_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2023.104761","volume":"183","author":"M Lv","year":"2024","unstructured":"Lv, M., Fan, J., Cheng, B., Yu, J., Jia, X.: Construction algorithms of fault-tolerant paths and disjoint paths in $$k$$-ary $$n$$-cube networks. J. Parallel Distrib. Comput. 183, 104761 (2024). https:\/\/doi.org\/10.1016\/j.jpdc.2023.104761","journal-title":"J. Parallel Distrib. Comput."},{"key":"25_CR11","doi-asserted-by":"publisher","unstructured":"Liu X., Fan J., Cheng B., Wang Y., Yin B., Jia X.: A family of general architectures towards interconnection networks and dater center networks. IEEE\/ACM Trans. Netw. https:\/\/doi.org\/10.1109\/TNET.2024.3411021.","DOI":"10.1109\/TNET.2024.3411021."},{"issue":"2","key":"25_CR12","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1007\/s12190-022-01794-z","volume":"69","author":"M Ma","year":"2023","unstructured":"Ma, M., Guo, C., Li, X.-J.: Disjoint paths in the enhanced hypercube with a faulty subgraph. J. Appl. Math. Comput. 69(2), 1343\u20131354 (2023). https:\/\/doi.org\/10.1007\/s12190-022-01794-z","journal-title":"J. Appl. Math. Comput."},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.dam.2020.09.008","volume":"289","author":"J-H Park","year":"2021","unstructured":"Park, J.-H.: Torus-like graphs and their paired many-to-many disjoint path covers. Discret. Appl. Math. 289, 64\u201377 (2021). https:\/\/doi.org\/10.1016\/j.dam.2020.09.008","journal-title":"Discret. Appl. Math."},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.tcs.2022.04.028","volume":"922","author":"S Wu","year":"2022","unstructured":"Wu, S., Fan, J., Cheng, B., Yu, J., Wang, Y.: Connectivity and constructive algorithms of disjoint paths in dragonfly networks. Theor. Comput. Sci. 922, 257\u2013270 (2022). https:\/\/doi.org\/10.1016\/j.tcs.2022.04.028","journal-title":"Theor. Comput. Sci."},{"issue":"14","key":"25_CR15","doi-asserted-by":"publisher","first-page":"3085","DOI":"10.1016\/j.ins.2011.02.019","volume":"181","author":"X Wang","year":"2011","unstructured":"Wang, X., Fan, J., Jia, X., Zhang, S., Yu, J.: Embedding meshes into twisted-cubes. Inf. Sci. 181(14), 3085\u20133099 (2011). https:\/\/doi.org\/10.1016\/j.ins.2011.02.019","journal-title":"Inf. Sci."},{"issue":"4","key":"25_CR16","doi-asserted-by":"publisher","first-page":"2772","DOI":"10.1109\/TNSE.2022.3169691","volume":"9","author":"Q Wang","year":"2022","unstructured":"Wang, Q., et al.: On searching multiple disjoint shortest paths in scale-free networks with hyperbolic geometry. IEEE Trans. Netw. Sci. Eng. 9(4), 2772\u20132785 (2022). https:\/\/doi.org\/10.1109\/TNSE.2022.3169691","journal-title":"IEEE Trans. Netw. Sci. Eng."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1093-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:18:35Z","timestamp":1739999915000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1093-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610921","9789819610938"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1093-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"20 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}