{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:26:24Z","timestamp":1743031584031,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030692438"},{"type":"electronic","value":"9783030692445"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-69244-5_8","type":"book-chapter","created":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T16:36:12Z","timestamp":1613838972000},"page":"94-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Construction of Completely Independent Spanning Tree Based on Vertex Degree"],"prefix":"10.1007","author":[{"given":"Ningning","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yujie","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Weibei","family":"Fan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,21]]},"reference":[{"issue":"3","key":"8_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 Theor. 77(3), 171\u2013179 (2014)","journal-title":"J. Graph Theor."},{"issue":"10","key":"8_CR2","doi-asserted-by":"publisher","first-page":"2191","DOI":"10.1587\/transfun.E98.A.2191","volume":"98","author":"H-Y Chang","year":"2015","unstructured":"Chang, H.-Y., Wang, H.-L., Yang, J.-S., Chang, J.-M.: A note on the degree condition of completely independent spanning trees. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98(10), 2191\u20132193 (2015)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"1\u20133","key":"8_CR3","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":"8_CR4","doi-asserted-by":"publisher","unstructured":"Fan, W., Fan, J., Zhang, Y., Han, Z., Chen, G.: Communication and performance evaluation of 3-ary $$n$$-cubes onto network-on-chips. SCI. CHINA Inf. Sci. 63 (2020). https:\/\/doi.org\/10.1007\/s11432-019-2794-9","DOI":"10.1007\/s11432-019-2794-9"},{"issue":"4","key":"8_CR5","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1016\/j.disc.2011.11.015","volume":"312","author":"F Pa\u00e9terfalvi","year":"2012","unstructured":"Pa\u00e9terfalvi, F.: Two counterexamples on completely independent spanning trees. Discrete Math. 312(4), 808\u2013810 (2012)","journal-title":"Discrete Math."},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"1","author":"GA Dirac","year":"1952","unstructured":"Dirac, G.A.: Some theorems on abstract graphs. Proc. London Math. Soc. 1, 69\u201381 (1952)","journal-title":"Proc. London Math. Soc."},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/s11390-019-1893-0","volume":"34","author":"W Fan","year":"2019","unstructured":"Fan, W., Fan, J., Lin, C.-K., Wang, Y., Han, Y., Wang, R.: Optimally embedding 3-ary $$n$$-cubes into grids. J. Comput. Sci. Technol. 34(2), 372\u2013387 (2019)","journal-title":"J. Comput. Sci. Technol."},{"issue":"11","key":"8_CR8","first-page":"1","volume":"32","author":"W Fan","year":"2020","unstructured":"Fan, W., He, J., Han, Z., Li, P., Wang, R.: Reconfigurable fault-tolerance mapping of ternary $$n$$-cubes onto chips. Concurrency Comput. Pract. Experience 32(11), 1\u201312 (2020)","journal-title":"Concurrency Comput. Pract. Experience"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.dam.2014.06.002","volume":"177","author":"G Fan","year":"2014","unstructured":"Fan, G., Hong, Y., Liu, Q.: Ore\u2019s condition for completely independent spanning trees. Discrete Appl. Math. 177, 95\u2013100 (2014)","journal-title":"Discrete Appl. Math."},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/j.ipl.2016.05.004","volume":"116","author":"X Hong","year":"2016","unstructured":"Hong, X., Liu, Q.: Degree condition for completely independent spanning trees. Inf. Process. Lett. 116, 644\u2013648 (2016)","journal-title":"Inf. Process. Lett."},{"issue":"11","key":"8_CR11","first-page":"1894","volume":"79","author":"K Obokata","year":"1996","unstructured":"Obokata, K., Iwasaki, Y., Bao, F., Igarashi, Y.: Independent spanning trees of product graphs and their construction. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 79(11), 1894\u20131903 (1996)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"9","key":"8_CR12","doi-asserted-by":"publisher","first-page":"2514","DOI":"10.1587\/transinf.2014EDL8079","volume":"97","author":"K-J Pai","year":"2014","unstructured":"Pai, K.-J., Yang, J.-S., Yao, S.-C., Tang, S.-M., Chang, J.-M.: Completely independent spanning trees on some interconnection networks. Ice Trans. Inf. Syst. 97(9), 2514\u20132517 (2014)","journal-title":"Ice Trans. Inf. Syst."},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Hsu, L.-H., Lin, C.-K.: Graph Theory and Interconnection Networks, CRC Press (2008)","DOI":"10.1201\/9781420044829"},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF01202468","volume":"15","author":"A Huck","year":"1999","unstructured":"Huck, A.: Independent trees in planar graphs. Graphs and Combinatorics 15(1), 29\u201377 (1999)","journal-title":"Graphs and Combinatorics"},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Fan, W., Fan, J., Han, Z., Li, P., Zhang, Y., Wang, R.: Fault-tolerant Hamiltonian cycles and paths embedding into locally exchanged twisted cubes. Front. Comput. Sci. pp. 1\u201321 (2020). https:\/\/doi.org\/10.1007\/s11704-020-9387-3","DOI":"10.1007\/s11704-020-9387-3"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-319-29516-9_22","volume-title":"Combinatorial Algorithms","author":"T Hasunuma","year":"2016","unstructured":"Hasunuma, T.: Minimum degree conditions and optimal graphs for completely independent spanning trees. In: Lipt\u00e1k, Z., Smyth, W.F. (eds.) IWOCA 2015. LNCS, vol. 9538, pp. 260\u2013273. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29516-9_22"},{"issue":"2","key":"8_CR17","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/s11227-018-2612-2","volume":"75","author":"W Fan","year":"2019","unstructured":"Fan, W., Fan, J., Lin, C.-K., Wang, G., Cheng, B., Wang, R.: An efficient algorithm for embedding exchanged hypercubes into grids. J. Supercomput. 75(2), 783\u2013807 (2019)","journal-title":"J. Supercomput."},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Fan, W., Wang, Y., Sun, J., Han, Z., Wang, R.: Fault-tolerant cycle embedding into 3-Ary $$n$$-Cubes with structure faults. In: IEEE International Conference on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA\/BDCloud\/SocialCom\/SustainCom), pp. 451\u2013458 (2019)","DOI":"10.1109\/ISPA-BDCloud-SustainCom-SocialCom48970.2019.00071"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.dam.2015.08.025","volume":"202","author":"N Lichiardopol","year":"2016","unstructured":"Lichiardopol, N.: Quasi-centers and radius related to some iterated line digraphs, proofs of several conjectures on de Bruijn and Kautz graphs. Discrete Appl. Math. 202, 106\u2013110 (2016)","journal-title":"Discrete Appl. Math."},{"issue":"11","key":"8_CR20","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.jcss.2019.02.005","volume":"105","author":"JH Park","year":"2019","unstructured":"Park, J.H., Lim, H.S., Kim, H.C.: Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs. J. Comput. Syst. Sci. 105(11), 104\u2013115 (2019)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR21","first-page":"1","volume":"3","author":"K-J Pai","year":"2020","unstructured":"Pai, K.-J., Chang, R.-S., Chang, J.-M.: Constructing dual-cists of pancake graphs and performance assessment of protection routings on some cayley networks. J. Supercomput. 3, 1\u201325 (2020)","journal-title":"J. Supercomput."},{"issue":"1","key":"8_CR22","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1109\/TC.2009.98","volume":"59","author":"S-M Tang","year":"2010","unstructured":"Tang, S.-M., Yang, J.-S., Wang, Y.-L., Chang, J.-M.: Independent spanning trees on multidimensional torus networks. IEEE Trans. Comput. 59(1), 93\u2013102 (2010)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"8_CR23","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.parco.2006.12.001","volume":"33","author":"J-S Yang","year":"2007","unstructured":"Yang, J.-S., Tang, S.-M., Chang, J.-M., Wang, Y.-L.: Parallel construction of optimal independent spanning trees on hypercubes. Parallel Comput. 33(1), 73\u201379 (2007)","journal-title":"Parallel Comput."},{"issue":"12","key":"8_CR24","doi-asserted-by":"publisher","first-page":"1713","DOI":"10.1016\/j.jpdc.2012.07.003","volume":"72","author":"J Werapun","year":"2012","unstructured":"Werapun, J., Intakosum, S., Boonjing, V.: An efficient parallel construction of optimal independent spanning trees on hypercubes. J. Parallel Distrib. Comput. 72(12), 1713\u20131724 (2012)","journal-title":"J. Parallel Distrib. Comput."},{"key":"8_CR25","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1007\/s00373-017-1827-y","volume":"33","author":"Y Wang","year":"2017","unstructured":"Wang, Y., Feng, Y., Zhou, J.: Automorphism group of the varietal hypercube graph. Graphs and Combinatorics 33, 1131\u20131137 (2017)","journal-title":"Graphs and Combinatorics"},{"issue":"1","key":"8_CR26","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1093\/comjnl\/bxs157","volume":"57","author":"J-S Yang","year":"2014","unstructured":"Yang, J.-S., Chang, J.-M.: Optimal independent spanning trees on Cartesian product of hybrid graphs. Comput. J. 57(1), 93\u201399 (2014)","journal-title":"Comput. J."},{"key":"8_CR27","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TPDS.2007.351709","volume":"18","author":"J-S Yang","year":"2007","unstructured":"Yang, J.-S., Chang, J.-M., Tang, S.-M., Wang, Y.-L.: Reducing the height of independent spanning trees in chordal rings. IEEE Trans. Parallel Distrib. Syst. 18, 644\u2013657 (2007)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing, Applications and Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-69244-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T16:40:10Z","timestamp":1613839210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-69244-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030692438","9783030692445"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-69244-5_8","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":"21 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PDCAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel and Distributed Computing: Applications and Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pdcat2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/hpcc.siat.ac.cn\/meeting\/pdcat-paap2020\/index.html","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":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"109","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":"34","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":"31% - 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":"6","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)"}}]}}