{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:04:00Z","timestamp":1742958240639,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030895426"},{"type":"electronic","value":"9783030895433"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89543-3_28","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:03:25Z","timestamp":1634781805000},"page":"330-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constructing Tri-CISTs in Shuffle-Cubes"],"prefix":"10.1007","author":[{"given":"Yu-Han","family":"Chen","sequence":"first","affiliation":[]},{"given":"Kung-Jui","family":"Pai","sequence":"additional","affiliation":[]},{"given":"Hsin-Jung","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Jou-Ming","family":"Chang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,20]]},"reference":[{"issue":"3","key":"28_CR1","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1002\/jgt.21780","volume":"77","author":"T Araki","year":"2014","unstructured":"Araki, T.: Dirac\u2019s condition for completely independent spanning trees. J. Graph Theory 77(3), 171\u2013179 (2014)","journal-title":"J. Graph Theory"},{"key":"28_CR2","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.: Constructing dual-CISTs of folded divide-and-swap cubes. Theor. Comput. Sci. 856, 75\u201387 (2021)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"28_CR3","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1109\/TPDS.2020.3029654","volume":"32","author":"G Chen","year":"2021","unstructured":"Chen, G., Cheng, B., Wang, D.: Constructing completely independent spanning trees in data center network based on augmented cube. IEEE Trans. Parallel Distrib. Syst. 32(3), 665\u2013673 (2021)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.dam.2016.11.019","volume":"219","author":"B Cheng","year":"2017","unstructured":"Cheng, B., Wang, D., Fan, J.: Constructing completely independent spanning trees in crossed cubes. Discrete Appl. Math. 219, 100\u2013109 (2017)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"28_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.dam.2016.09.007","volume":"217","author":"B Darties","year":"2017","unstructured":"Darties, B., Gastineau, N., Togni, O.: Completely independent spanning trees in some regular graphs. Discrete Appl. Math. 217(2), 163\u2013174 (2017)","journal-title":"Discrete Appl. Math."},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.tcs.2020.06.015","volume":"835","author":"T Ding","year":"2020","unstructured":"Ding, T., Li, P., Xu, M.: The component (edge) connectivity of shuffle-cubes. Theor. Comput. Sci. 835, 108\u2013119 (2020)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"28_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0012-365X(00)00377-0","volume":"234","author":"T Hasunuma","year":"2001","unstructured":"Hasunuma, T.: Completely independent spanning trees in the underlying graph of a line digraph. Discrete Math. 234(1\u20133), 149\u2013157 (2001)","journal-title":"Discrete Math."},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/3-540-36379-3_21","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T Hasunuma","year":"2002","unstructured":"Hasunuma, T.: Completely independent spanning trees in maximal planar graphs. In: Goos, G., Hartmanis, J., van Leeuwen, J., Ku\u010dera, L. (eds.) WG 2002. LNCS, vol. 2573, pp. 235\u2013245. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36379-3_21"},{"issue":"1","key":"28_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.20460","volume":"60","author":"T Hasunuma","year":"2012","unstructured":"Hasunuma, T., Morisaka, C.: Completely independent spanning trees in torus networks. Networks 60(1), 59\u201369 (2012)","journal-title":"Networks"},{"issue":"1","key":"28_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0020-0190(00)00147-2","volume":"77","author":"T-K Li","year":"2001","unstructured":"Li, T.-K., Tan, J.M., Hsu, L.-H., Sung, T.Y.: The shuffle-cubes and their generalization. Inf. Process. Lett. 77(1), 35\u201341 (2001)","journal-title":"Inf. Process. Lett."},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.jpdc.2018.08.006","volume":"122","author":"SA Mane","year":"2018","unstructured":"Mane, S.A., Kandekar, S.A., Waphare, B.N.: Constructing spanning trees in augmented cubes. J. Parallel Distrib. Comput. 122, 188\u2013194 (2018)","journal-title":"J. Parallel Distrib. Comput."},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2016.08.024","volume":"652","author":"K-J Pai","year":"2016","unstructured":"Pai, K.-J., Chang, J.-M.: Constructing two completely independent spanning trees in hypercube-variant networks. Theor. Comput. Sci. 652, 28\u201337 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"28_CR13","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1109\/TNET.2019.2910019","volume":"27","author":"K-J Pai","year":"2019","unstructured":"Pai, K.-J., Chang, J.-M.: Dual-CISTs: configuring a protection routing on some Cayley networks. IEEE\/ACM Trans. Netw. 27(3), 1112\u20131123 (2019)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jpdc.2020.02.007","volume":"140","author":"K-J 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":"28_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2019.105874","volume":"155","author":"K-J Pai","year":"2020","unstructured":"Pai, K.-J., Chang, R.-S., Chang, J.-M.: A well-equalized 3-CIST partition of alternating group graphs. Inf. Process. Lett. 155, 105874 (2020)","journal-title":"Inf. Process. Lett."},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.tcs.2019.03.035","volume":"784","author":"K-J Pai","year":"2019","unstructured":"Pai, K.-J., Chang, R.-S., Wu, R.-Y., Chang, J.-M.: A two-stages tree-searching algorithm for finding three completely independent spanning trees. Theor. Comput. Sci. 784, 65\u201374 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1016\/j.ins.2020.05.048","volume":"541","author":"K-J 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":"4","key":"28_CR18","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1016\/j.disc.2011.11.015","volume":"312","author":"F P\u00e9terfalvi","year":"2012","unstructured":"P\u00e9terfalvi, F.: Two counterexamples on completely independent spanning trees. Discrete Math. 312(4), 808\u2013810 (2012)","journal-title":"Discrete Math."},{"key":"28_CR19","volume":"397","author":"X-W Qin","year":"2021","unstructured":"Qin, X.-W., Hao, R.-X.: Reliability analysis based on the dual-CIST in shuffle-cubes. Appl. Math. Comput. 397, 125900 (2021)","journal-title":"Appl. Math. Comput."},{"key":"28_CR20","volume":"362","author":"X-W Qin","year":"2019","unstructured":"Qin, X.-W., Hao, R.-X., Chang, J.-M.: Constructing dual-CISTs of DCell data center networks. Appl. Math. Comput. 362, 124546 (2019)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"28_CR21","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/TPDS.2019.2931904","volume":"31","author":"X-W Qin","year":"2020","unstructured":"Qin, X.-W., Hao, R.-X., Chang, J.-M.: The existence of completely independent spanning trees for some compound graphs. IEEE Trans. Parallel Distrib. Syst. 31(1), 201\u2013210 (2020)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"4","key":"28_CR22","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.ipl.2005.07.005","volume":"96","author":"J-M Xu","year":"2005","unstructured":"Xu, J.-M., Xu, M., Zhu, Q.: The super connectivity of shuffle-cubes. Inf. Process. Lett. 96(4), 123\u2013127 (2005)","journal-title":"Inf. Process. Lett."}],"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-3-030-89543-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:15:26Z","timestamp":1634782526000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89543-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030895426","9783030895433"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89543-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2021\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"131","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":"56","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":"43% - 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.1","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":"2.2","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}