{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T00:10:12Z","timestamp":1777162212185,"version":"3.51.4"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319947754","type":"print"},{"value":"9783319947761","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-94776-1_1","type":"book-chapter","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T01:48:06Z","timestamp":1530236886000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Constructing Independent Spanning Trees on Bubble-Sort Networks"],"prefix":"10.1007","author":[{"given":"Shih-Shun","family":"Kao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jou-Ming","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kung-Jui","family":"Pai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ro-Yu","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/12.21148","volume":"28","author":"SB Akers","year":"1989","unstructured":"Akers, S.B., Krishnamurty, B.: A group theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 28, 555\u2013566 (1989)","journal-title":"IEEE Trans. Comput."},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"2679","DOI":"10.1016\/j.ins.2007.01.017","volume":"177","author":"T Araki","year":"2007","unstructured":"Araki, T., Kikuchi, Y.: Hamiltonian laceability of bubble-sort graphs with edge faults. Inform. Sci. 177, 2679\u20132691 (2007)","journal-title":"Inform. Sci."},{"key":"1_CR3","unstructured":"Bao, F., Funyu, Y., Hamada, Y., Igarashi, Y.: Reliable broadcasting and secure distributing in channel networks. In: Proceedings of 3rd International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN 1997), Taipei, pp. 472\u2013478 (1997)"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1007\/s10878-016-0018-8","volume":"33","author":"Y-H Chang","year":"2017","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, 956\u2013967 (2017)","journal-title":"J. Comb. Optim."},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.dam.2016.11.017","volume":"219","author":"J-M Chang","year":"2017","unstructured":"Chang, J.-M., Yang, T.-J., Yang, J.-S.: A parallel algorithm for constructing independent spanning trees in twisted cubes. Discret. Appl. Math. 219, 74\u201382 (2017)","journal-title":"Discret. Appl. Math."},{"key":"1_CR6","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, 507\u2013537 (1988)","journal-title":"J. Algorithms"},{"key":"1_CR7","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.: Finding four independent trees. SIAM J. Comput. 35, 1023\u20131058 (2006)","journal-title":"SIAM J. Comput."},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.tcs.2016.02.024","volume":"627","author":"R-X Hao","year":"2012","unstructured":"Hao, R.-X., Tian, Z.-X., Xu, J.-M.: Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs. Theor. Comput. Sci. 627, 36\u201353 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"1_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. Inform. Comput. 79, 43\u201359 (1988)","journal-title":"Inform. Comput."},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.ipl.2006.05.012","volume":"100","author":"Y Kikuchi","year":"2006","unstructured":"Kikuchi, Y., Araki, T.: Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs. Inform. Process. Lett. 100, 52\u201359 (2006)","journal-title":"Inform. Process. Lett."},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-319-71150-8_4","volume-title":"Combinatorial Optimization and Applications","author":"S-S Kao","year":"2017","unstructured":"Kao, S.-S., Chang, J.-M., Pai, K.-J., Yang, J.-S., Tang, S.-M., Wu, R.-Y.: A parallel construction of vertex-disjoint spanning trees with optimal heights in star networks. In: Gao, X., Du, H., Han, M. (eds.) COCOA 2017. LNCS, vol. 10627, pp. 41\u201355. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71150-8_4"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Kao, S.-S., Chang, J.-M., Pai, K.-J., Wu, R.-Y.: Open source for \u201cConstructing independent spanning trees on bubble-sort networks\". https:\/\/sites.google.com\/ntub.edu.tw\/ist-bs\/. Accessed 8 Jan 2018","DOI":"10.1007\/978-3-319-94776-1_1"},{"key":"1_CR13","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., Dhall, S.K.: Symmetry in interconnection networks based on Cayley graphs of permutation groups: a survey. Parallel Comput. 19, 361\u2013407 (1993)","journal-title":"Parallel Comput."},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.tcs.2017.01.021","volume":"670","author":"T-L Kung","year":"2017","unstructured":"Kung, T.-L., Hung, C.-N.: Estimating the subsystem reliability of bubblesort networks. Theor. Comput. Sci. 670, 45\u201355 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"1_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. Inform. Sci. 137, 259\u2013276 (2001)","journal-title":"Inform. Sci."},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1002\/scj.20518","volume":"37","author":"Y Suzuki","year":"2006","unstructured":"Suzuki, Y., Kaneko, K.: An algorithm for disjoint paths in bubble-sort graphs. Syst. Comput. Jpn. 37, 27\u201332 (2006)","journal-title":"Syst. Comput. Jpn."},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1093\/ietisy\/e91-d.4.1003","volume":"E91\u2013D","author":"Y Suzuki","year":"2008","unstructured":"Suzuki, Y., Kaneko, K.: The container problem in bubble-sort graphs. IEICE Trans. Inf. Syst. E91\u2013D, 1003\u20131009 (2008)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1080\/00207160.2015.1119817","volume":"94","author":"M Wang","year":"2017","unstructured":"Wang, M., Guo, Y., Wang, S.: The 1-good-neighbour diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM* model. Int. J. Comput. Math. 94, 620\u2013631 (2017)","journal-title":"Int. J. Comput. Math."},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.tcs.2016.03.019","volume":"628","author":"M Wang","year":"2016","unstructured":"Wang, M., Lin, Y., Wang, S.: The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM* model. Theor. Comput. Sci. 628, 92\u2013100 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.tcs.2011.11.016","volume":"421","author":"S Wang","year":"2012","unstructured":"Wang, S., Yang, Y.: Fault tolerance in bubble-sort graph networks. Theor. Comput. Sci. 421, 62\u201369 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.ipl.2015.06.011","volume":"115","author":"Y Yang","year":"2015","unstructured":"Yang, Y., Wang, S., Li, J.: Subnetwork preclusion for bubble-sort graph networks. Inform. Process. Lett. 115, 817\u2013821 (2015)","journal-title":"Inform. Process. Lett."},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1016\/j.dam.2011.04.014","volume":"159","author":"J-S Yang","year":"2011","unstructured":"Yang, J.-S., Chan, H.-C., Chang, J.-M.: Broadcasting secure messages via optimal independent spanning trees in folded hypercubes. Discret. Appl. Math. 159, 1254\u20131263 (2011)","journal-title":"Discret. Appl. Math."},{"key":"1_CR23","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, 175\u2013188 (1989)","journal-title":"J. Graph Theory"},{"key":"1_CR24","first-page":"53","volume":"180","author":"S Zhou","year":"2013","unstructured":"Zhou, S., Wang, J., Xu, X., Xu, J.-M.: Conditional fault diagnosis of bubble sort graphs under the PMC model. Intel. Comput. Evol. Comput. 180, 53\u201359 (2013). AISC","journal-title":"Intel. Comput. Evol. Comput."}],"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-319-94776-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:32:29Z","timestamp":1710347549000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94776-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319947754","9783319947761"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94776-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 June 2018","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":"Qing Dao","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon2018.sdu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}