{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:38:23Z","timestamp":1740123503035,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T00:00:00Z","timestamp":1642636800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T00:00:00Z","timestamp":1642636800000},"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":["J Supercomput"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s11227-021-04296-0","type":"journal-article","created":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T12:07:10Z","timestamp":1642680430000},"page":"9879-9906","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Independent spanning trees on WK-recursive networks and WK-recursive pyramids"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3337-5821","authenticated-orcid":false,"given":"Fu-Hsing","family":"Wang","sequence":"first","affiliation":[]},{"given":"Shuo-I","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,20]]},"reference":[{"key":"4296_CR1","unstructured":"Bao F, Funyu Y, Hamada Y, Igarashi Y (1997) Reliable broadcasting and secure distributing in channel networks. In: ISPAN, p 472"},{"key":"4296_CR2","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1093\/comjnl\/bxs123","volume":"56","author":"B Cheng","year":"2013","unstructured":"Cheng B, Fan J, Jia X, Zhang S, Chen B (2013) Constructive algorithm of independent spanning trees on M\u00f6bius cubes. Comput J 56:1347\u20131362","journal-title":"Comput J"},{"key":"4296_CR3","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1016\/j.ipl.2014.06.015","volume":"114","author":"JM Chang","year":"2014","unstructured":"Chang JM, Wang JD, Yang JS, Pai KJ (2014) A comment on independent spanning trees in crossed cubes. Inf Process Lett 114:734\u2013739","journal-title":"Inf Process Lett"},{"key":"4296_CR4","doi-asserted-by":"publisher","first-page":"3427","DOI":"10.1109\/ACCESS.2019.2962549","volume":"8","author":"DW Cheng","year":"2020","unstructured":"Cheng DW, Chan CT, Hsieh SY (2020) Constructing independent spanning trees on pancake networks. IEEE Access 8:3427\u20133433","journal-title":"IEEE Access"},{"key":"4296_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 SN (1988) Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. J Algorithms 9:507\u2013537","journal-title":"J Algorithms"},{"issue":"3","key":"4296_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0167-739X(88)90007-6","volume":"4","author":"G Della Vecchia","year":"1988","unstructured":"Della Vecchia G, Sanges C (1988) A recursively scalable network VLSI implementation. Future Gener Comput Syst 4(3):235\u2013243","journal-title":"Future Gener Comput Syst"},{"issue":"9","key":"4296_CR7","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1109\/TPDS.2005.109","volume":"16","author":"JS Fu","year":"2005","unstructured":"Fu JS (2005) Hamiltonicity of the WK-Recursive network with and without faulty vertices. IEEE Trans Parallel Distrib Syst 16(9):853\u2013865","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4296_CR8","doi-asserted-by":"crossref","unstructured":"Farahabady MH, Sarbazi-Azad H (2005) The WK-recursive pyramid: an efficient network topology. In: Proceedings of the 8th International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN\u201905), pp 312\u2013317","DOI":"10.1109\/ISPAN.2005.85"},{"key":"4296_CR9","doi-asserted-by":"publisher","first-page":"175932","DOI":"10.1109\/ACCESS.2020.3025009","volume":"8","author":"JF Huang","year":"2020","unstructured":"Huang JF, Cheng E, Hsieh SY (2020) Two algorithms for constructing independent spanning trees in (n, k)-star graphs. IEEE Access 8:175932\u2013175947","journal-title":"IEEE Access"},{"key":"4296_CR10","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.jpdc.2017.06.018","volume":"109","author":"Z Hussain","year":"2017","unstructured":"Hussain Z, AlBdaiwi B, Cerny A (2017) Node-independent spanning trees in Gaussian networks. J Parallel Distrib Comput 109:324\u2013332","journal-title":"J Parallel Distrib Comput"},{"key":"4296_CR11","volume-title":"Transputer reference manual","author":"INMOS Limited","year":"1988","unstructured":"INMOS Limited (1988) Transputer reference manual. Prentice-Hall, Upper Saddle River, NJ"},{"key":"4296_CR12","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1007\/s10878-019-00430-0","volume":"38","author":"SS Kao","year":"2019","unstructured":"Kao SS, Pai KJ, Hsieh SY, Wu RY, Chang JM (2019) Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks. J Comb Optim 38:972\u2013986","journal-title":"J Comb Optim"},{"key":"4296_CR13","doi-asserted-by":"publisher","first-page":"147122","DOI":"10.1109\/ACCESS.2020.3014822","volume":"8","author":"CF Lin","year":"2020","unstructured":"Lin CF, Huang JF, Hsieh SY (2020) Constructing independent spanning trees on transposition networks. IEEE Access 8:147122\u2013147132","journal-title":"IEEE Access"},{"issue":"1","key":"4296_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s11235-008-9077-1","volume":"37","author":"S Suboh","year":"2008","unstructured":"Suboh S, Bakhouya M, Gaber J, El-Ghazawi T (2008) An interconnection architecture for network-onchip systems. Telecommun Syst 37(1):137\u2013144","journal-title":"Telecommun Syst"},{"issue":"1","key":"4296_CR15","first-page":"143","volume":"20","author":"SM Tang","year":"2004","unstructured":"Tang SM, Wang YL, Leu YH (2004) Optimal independent spanning trees on hypercubes. J Inf Sci Eng 20(1):143\u2013155","journal-title":"J Inf Sci Eng"},{"key":"4296_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.tcs.2012.08.020","volume":"465","author":"Y Wang","year":"2012","unstructured":"Wang Y, Fan J, Jia X, Huang H (2012) An algorithm to construct independent spanning trees on parity cubes. Theor Comput Sci 465:61\u201372","journal-title":"Theor Comput Sci"},{"key":"4296_CR17","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1093\/comjnl\/bxw054","volume":"60","author":"SI Wang","year":"2017","unstructured":"Wang SI, Wang FH (2017) Independent spanning trees in RTCC-pyramids. Comput J 60:13\u201326","journal-title":"Comput J"},{"key":"4296_CR18","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1007\/s10878-020-00521-3","volume":"39","author":"SI Wang","year":"2020","unstructured":"Wang SI, Wang FH (2020) Linear time algorithms for finding independent spanning trees on pyramid networks. J Comb Optim 39:826\u2013848","journal-title":"J Comb Optim"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-04296-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-021-04296-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-04296-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,19]],"date-time":"2022-04-19T15:25:30Z","timestamp":1650381930000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-021-04296-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,20]]},"references-count":18,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["4296"],"URL":"https:\/\/doi.org\/10.1007\/s11227-021-04296-0","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2022,1,20]]},"assertion":[{"value":"24 December 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}