{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T00:28:16Z","timestamp":1769560096298,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819707973","type":"print"},{"value":"9789819707980","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-0798-0_3","type":"book-chapter","created":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T08:03:04Z","timestamp":1709193784000},"page":"40-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Node-Disjoint Paths in\u00a0Balanced Hypercubes with\u00a0Application to\u00a0Fault-Tolerant Routing"],"prefix":"10.1007","author":[{"given":"Shuai","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jianxi","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Baolei","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,1]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.dam.2021.08.036","volume":"305","author":"D Cheng","year":"2021","unstructured":"Cheng, D.: The $$h$$-restricted connectivity of balanced hypercubes. Discret. Appl. Math. 305, 133\u2013141 (2021)","journal-title":"Discret. Appl. Math."},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.amc.2014.05.037","volume":"242","author":"D Cheng","year":"2014","unstructured":"Cheng, D., Hao, R.X., Feng, Y.Q.: Two node-disjoint paths in balanced hypercubes. Appl. Math. Comput. 242, 127\u2013142 (2014)","journal-title":"Appl. Math. Comput."},{"issue":"8","key":"3_CR3","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1007\/s10114-007-6509-x","volume":"24","author":"BS Choudhury","year":"2008","unstructured":"Choudhury, B.S., Das, K.: A new contraction principle in menger spaces. Acta Math. Sin. Engl. Ser. 24(8), 1379\u20131386 (2008)","journal-title":"Acta Math. Sin. Engl. Ser."},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/71.262586","volume":"5","author":"K Day","year":"1994","unstructured":"Day, K., Tripathi, A.: A comparative study of topological properties of hypercubes and star graphs. IEEE Trans. Parallel Distrib. Syst. 5(1), 31\u201338 (1994)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Fu, J.S., Chen, G.H., Duh, D.R.: Node-disjoint paths and related problems on hierarchical cubic networks. Netw. Int. J. 40(3), 142\u2013154 (2002)","DOI":"10.1002\/net.10040"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Guo, C., et al.: Bcube: a high performance, server-centric network architecture for modular data centers. In: Proceedings of the ACM SIGCOMM 2009 Conference on Data Communication, pp. 63\u201374 (2009)","DOI":"10.1145\/1592568.1592577"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/j.amc.2014.07.015","volume":"244","author":"RX Hao","year":"2014","unstructured":"Hao, R.X., Zhang, R., Feng, Y.Q., Zhou, J.X.: Hamiltonian cycle embedding for fault tolerance in balanced hypercubes. Appl. Math. Comput. 244, 447\u2013456 (2014)","journal-title":"Appl. Math. Comput."},{"issue":"6","key":"3_CR8","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1109\/TPDS.2011.261","volume":"23","author":"CN Lai","year":"2011","unstructured":"Lai, C.N.: Optimal construction of all shortest node-disjoint paths in hypercubes with applications. IEEE Trans. Parallel Distrib. Syst. 23(6), 1129\u20131134 (2011)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"3_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0020-0190(93)90060-M","volume":"46","author":"S Latifi","year":"1993","unstructured":"Latifi, S.: On the fault-diameter of the star graph. Inf. Process. Lett. 46(3), 143\u2013150 (1993)","journal-title":"Inf. Process. Lett."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.tcs.2020.09.015","volume":"845","author":"H Liu","year":"2020","unstructured":"Liu, H., Cheng, D.: Structure fault tolerance of balanced hypercubes. Theor. Comput. Sci. 845, 198\u2013207 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/s11227-018-02734-0","volume":"75","author":"H L\u00fc","year":"2019","unstructured":"L\u00fc, H.: Paired many-to-many two-disjoint path cover of balanced hypercubes with faulty edges. J. Supercomput. 75, 400\u2013424 (2019)","journal-title":"J. Supercomput."},{"issue":"08","key":"3_CR12","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1142\/S0129054121500301","volume":"32","author":"H L\u00fc","year":"2021","unstructured":"L\u00fc, H., Wu, T.: Unpaired many-to-many disjoint path cover of balanced hypercubest. Int. J. Found. Comput. Sci. 32(08), 943\u2013956 (2021)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jpdc.2020.02.007","volume":"140","author":"KJ Pai","year":"2020","unstructured":"Pai, K.J., Chang, R.S., Chang, J.M.: A protection routing with secure mechanism in m\u00f6bius cubes. J. Parallel Distrib. Comput. 140, 1\u201312 (2020)","journal-title":"J. Parallel Distrib. Comput."},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1016\/j.ins.2020.05.048","volume":"541","author":"KJ Pai","year":"2020","unstructured":"Pai, K.J., Chang, R.S., Wu, R.Y., Chang, J.M.: Three completely independent spanning trees of crossed cubes with application to secure-protection routing. Inf. Sci. 541, 516\u2013530 (2020)","journal-title":"Inf. Sci."},{"issue":"3","key":"3_CR15","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1109\/TPDS.2019.2941207","volume":"31","author":"G Wang","year":"2019","unstructured":"Wang, G., Lin, C.K., Fan, J., Cheng, B., Jia, X.: A novel low cost interconnection architecture based on the generalized hypercube. IEEE Trans. Parallel Distrib. Syst. 31(3), 647\u2013662 (2019)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"3_CR16","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.: Vertex-disjoint paths in DCell networks. J. Parallel Distrib. Comput. 96, 38\u201344 (2016)","journal-title":"J. Parallel Distrib. Comput."},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.dam.2020.12.011","volume":"292","author":"C Wei","year":"2021","unstructured":"Wei, C., Hao, R.X., Chang, J.M.: The reliability analysis based on the generalized connectivity in balanced hypercubes. Discret. Appl. Math. 292, 19\u201332 (2021)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"3_CR18","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1109\/12.588063","volume":"46","author":"J Wu","year":"1997","unstructured":"Wu, J., Huang, K.: The balanced hypercube: a cube-based system for fault-tolerant applications. IEEE Trans. Comput. 46(4), 484\u2013490 (1997)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"3_CR19","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1016\/j.amc.2012.06.077","volume":"219","author":"MC Yang","year":"2012","unstructured":"Yang, M.C.: Super connectivity of balanced hypercubes. Appl. Math. Comput. 219(3), 970\u2013975 (2012)","journal-title":"Appl. Math. Comput."},{"issue":"12","key":"3_CR20","doi-asserted-by":"publisher","first-page":"2409","DOI":"10.1587\/transinf.2019PAL0001","volume":"102","author":"YX Yang","year":"2019","unstructured":"Yang, Y.X., Pai, K.J., Chang, R.S., Chang, J.M.: Constructing two completely independent spanning trees in balanced hypercubes. IEICE Trans. Inf. Syst. 102(12), 2409\u20132412 (2019)","journal-title":"IEICE Trans. Inf. Syst."},{"issue":"3","key":"3_CR21","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1109\/TC.2014.2304391","volume":"64","author":"JX Zhou","year":"2014","unstructured":"Zhou, J.X., Wu, Z.L., Yang, S.C., Yuan, K.W.: Symmetric property and reliability of balanced hypercube. IEEE Trans. Comput. 64(3), 876\u2013881 (2014)","journal-title":"IEEE Trans. Comput."},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/s11227-009-0304-7","volume":"54","author":"S Zhou","year":"2010","unstructured":"Zhou, S., Xiao, W., Parhami, B.: Construction of vertex-disjoint paths in alternating group networks. J. Supercomput. 54, 206\u2013228 (2010)","journal-title":"J. Supercomput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0798-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T08:03:34Z","timestamp":1709193814000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0798-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819707973","9789819707980"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0798-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"1 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tjutanklab.com\/ica3pp2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Online submission system","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"439","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"145","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}