{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:07:37Z","timestamp":1742972857425,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581497"},{"type":"electronic","value":"9783030581503"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-58150-3_16","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"198-209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constructing Independent Spanning Trees in Alternating Group Networks"],"prefix":"10.1007","author":[{"given":"Jie-Fu","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sun-Yuan","family":"Hsieh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"SB Akers","year":"1989","unstructured":"Akers, S.B., Krishnamurthy, B.: A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38, 555\u2013566 (1989)","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"16_CR2","first-page":"796","volume":"81","author":"F Bao","year":"1998","unstructured":"Bao, F., Funyu, Y., Hamada, Y., Igarashi, Y.: Reliable broadcasting and secure distributing in channel networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 81(5), 796\u2013806 (1998)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"3","key":"16_CR3","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1007\/s10878-016-0018-8","volume":"33","author":"Y-H Chang","year":"2016","unstructured":"Chang, Y.-H., Yang, J.-S., Hsieh, S.-Y., Chang, J.-M., Wang, Y.-L.: Construction independent spanning trees on locally twisted cubes in parallel. J. Comb. Optim. 33(3), 956\u2013967 (2016). https:\/\/doi.org\/10.1007\/s10878-016-0018-8","journal-title":"J. Comb. Optim."},{"issue":"12","key":"16_CR4","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1109\/TC.2006.199","volume":"55","author":"B Chen","year":"2006","unstructured":"Chen, B., Xiao, W., Parhami, B.: Internode distance and optimal routing in a class of alternating group networks. IEEE Trans. Comput. 55(12), 1645\u20131648 (2006)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"16_CR5","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1016\/0196-6774(88)90015-6","volume":"9","author":"J Cheriyan","year":"1988","unstructured":"Cheriyan, J., Maheshwari, S.N.: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. J. Algorithms 9(4), 507\u2013537 (1988)","journal-title":"J. Algorithms"},{"issue":"5","key":"16_CR6","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1137\/S0097539703436734","volume":"35","author":"S Curran","year":"2006","unstructured":"Curran, S., Lee, O., Yu, X.X.: Finding four independent trees. SIAM J. Comput. 35(5), 1023\u20131058 (2006)","journal-title":"SIAM J. Comput."},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0166-218X(92)90138-Z","volume":"37\u201338","author":"YO Hamidoune","year":"1992","unstructured":"Hamidoune, Y.O., Llado, A.S., Serra, O.: The connectivity of hierarchical Cayley digraphs. Discrete Appl. Math. 37\u201338, 275\u2013280 (1992)","journal-title":"Discrete Appl. Math."},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1016\/j.tcs.2008.12.025","volume":"410","author":"SY Hsieh","year":"2009","unstructured":"Hsieh, S.Y., Tu, C.J.: Constructing edge-disjoint spanning trees in locally twisted cubes. Theor. Comput. Sci. 410, 926\u2013932 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(88)90016-8","volume":"79","author":"A Itai","year":"1988","unstructured":"Itai, A., Rodeh, M.: The multi-tree approach to reliability in distributed networks. Inf. Comput. 79(1), 43\u201359 (1988)","journal-title":"Inf. Comput."},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-94776-1_1","volume-title":"Computing and Combinatorics","author":"S-S Kao","year":"2018","unstructured":"Kao, S.-S., Chang, J.-M., Pai, K.-J., Wu, R.-Y.: Constructing independent spanning trees on bubble-sort networks. In: Wang, L., Zhu, D. (eds.) COCOON 2018. LNCS, vol. 10976, pp. 1\u201313. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94776-1_1"},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1007\/s10878-019-00430-0","volume":"38","author":"S-S Kao","year":"2019","unstructured":"Kao, S.-S., Pai, K.-J., Hsieh, S.-Y., Wu, R.-Y., Chang, J.-M.: Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks. J. Comb. Optim. 38(3), 972\u2013986 (2019). https:\/\/doi.org\/10.1007\/s10878-019-00430-0","journal-title":"J. Comb. Optim."},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0167-8191(93)90054-O","volume":"19","author":"S Lakshmivarahan","year":"1993","unstructured":"Lakshmivarahan, S., Jwo, J.S., Dhall, S.K.: Symmetry in interconnection networks based on Cayley graphs of permutations: a survey. Parallel Comput. 19, 361\u2013407 (1993)","journal-title":"Parallel Comput."},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"2237","DOI":"10.1016\/j.tcs.2010.12.061","volume":"412","author":"YJ Liu","year":"2011","unstructured":"Liu, Y.J., Lan, J.K., Chou, W.Y., Chen, C.: Constructing independent spanning trees for locally twisted cubes. Theor. Comput. Sci. 412, 2237\u20132252 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.compbiomed.2016.01.004","volume":"70","author":"E Silva","year":"2016","unstructured":"Silva, E., Pedrini, H.: Inferring patterns in mitochondrial DNA sequences through hypercube independent spanning trees. Comput. Biol. Med. 70, 51\u201357 (2016)","journal-title":"Comput. Biol. Med."},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0020-0255(01)00121-9","volume":"137","author":"AA Rescigno","year":"2001","unstructured":"Rescigno, A.A.: Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security. Inf. Sci. 137, 259\u2013276 (2001)","journal-title":"Inf. Sci."},{"issue":"12","key":"16_CR16","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":"16_CR17","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.parco.2006.12.001","volume":"33","author":"JS Yang","year":"2007","unstructured":"Yang, J.S., Chang, J.M., Tang, S.M., Wang, Y.L.: Parallel construction of optimal independent spanning trees on hypercubes. Parallel Comput. 33, 73\u201379 (2007)","journal-title":"Parallel Comput."},{"issue":"12","key":"16_CR18","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1016\/j.dam.2011.04.014","volume":"159","author":"JS Yang","year":"2011","unstructured":"Yang, J.S., Chan, H.C., Chang, J.M.: Broadcasting secure messages via optimal independent spanning trees in folded hypercubes. Discrete Appl. Math. 159(12), 1254\u20131263 (2011)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"16_CR19","first-page":"235","volume":"14A","author":"J Youhu","year":"1998","unstructured":"Youhu, J.: A new class of Cayley networks based on the alternating groups. Appl. Math.-JCU 14A(2), 235\u2013239 (1998). in Chinese","journal-title":"Appl. Math.-JCU"},{"issue":"2","key":"16_CR20","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1002\/jgt.3190130205","volume":"13","author":"A Zehavi","year":"1989","unstructured":"Zehavi, A., Itai, A.: Three tree-paths. J. Graph Theory 13(2), 175\u2013188 (1989)","journal-title":"J. Graph Theory"},{"issue":"2","key":"16_CR21","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. Supercomputing 54(2), 206\u2013228 (2010)","journal-title":"Supercomputing"}],"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-58150-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T19:40:25Z","timestamp":1619206825000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"27 August 2020","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":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"29 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2020\/","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":"126","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":"54","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":"2.7","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":"10.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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}