{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T09:15:41Z","timestamp":1790500541969,"version":"4.1.0"},"reference-count":46,"publisher":"Oxford University Press (OUP)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1093\/comjnl\/bxv029","type":"journal-article","created":{"date-parts":[[2015,4,23]],"date-time":"2015-04-23T02:11:36Z","timestamp":1429755096000},"page":"2972-2981","source":"Crossref","is-referenced-by-count":10,"title":["Pruning Longer Branches of Independent Spanning Trees on Folded Hyper-Stars"],"prefix":"10.1093","volume":"58","author":[{"given":"Jinn-Shyong","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sih-Syuan","family":"Luo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jou-Ming","family":"Chang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2015,4,22]]},"reference":[{"key":"2015102808332001000_58.11.2972.1","unstructured":"Bao F. Funyu Y. Hamada Y. Igarashi Y. (1997) Reliable Broadcasting and Secure Distributing in Channel Networks. Proc. 3rd Int. Symp. Parallel Architectures, Algorithms and Networks, ISPAN\u201997, Taipei, December 18\u201320, pp. 472\u2013478. IEEE Computer Society Press."},{"key":"2015102808332001000_58.11.2972.2","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90016-8"},{"key":"2015102808332001000_58.11.2972.3","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(01)00121-9"},{"key":"2015102808332001000_58.11.2972.4","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.04.014"},{"key":"2015102808332001000_58.11.2972.5","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(88)90015-6"},{"key":"2015102808332001000_58.11.2972.6","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130205"},{"key":"2015102808332001000_58.11.2972.7","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703436734"},{"key":"2015102808332001000_58.11.2972.8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.12.042"},{"key":"2015102808332001000_58.11.2972.9","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054110007143"},{"key":"2015102808332001000_58.11.2972.10","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244198"},{"key":"2015102808332001000_58.11.2972.11","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00269-9"},{"key":"2015102808332001000_58.11.2972.12","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00205-1"},{"key":"2015102808332001000_58.11.2972.13","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.351709"},{"key":"2015102808332001000_58.11.2972.14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.11.018"},{"key":"2015102808332001000_58.11.2972.15","unstructured":"Obokata K. Iwasaki Y. Bao F. Igarashi Y. (1996) Independent spanning trees of product graphs and their construction. IEICE Trans. Fund. Electron. Commun. Comput. Sci., E79-A, 1894\u20131903."},{"key":"2015102808332001000_58.11.2972.16","unstructured":"Tang S.-M. Wang Y.-L. Leu Y.-H. (2004) Optimal independent spanning trees on hypercubes. J. Inf. Sci. Eng., 20, 143\u2013155."},{"key":"2015102808332001000_58.11.2972.17","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2009.98"},{"key":"2015102808332001000_58.11.2972.18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2012.07.003"},{"key":"2015102808332001000_58.11.2972.19","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxs157"},{"key":"2015102808332001000_58.11.2972.20","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2006.12.001"},{"key":"2015102808332001000_58.11.2972.21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2014.06.015"},{"key":"2015102808332001000_58.11.2972.22","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-013-0883-1"},{"key":"2015102808332001000_58.11.2972.23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2013.01.009"},{"key":"2015102808332001000_58.11.2972.24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.01.010"},{"key":"2015102808332001000_58.11.2972.25","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxs123"},{"key":"2015102808332001000_58.11.2972.26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.03.012"},{"key":"2015102808332001000_58.11.2972.27","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.12.061"},{"key":"2015102808332001000_58.11.2972.28","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.08.020"},{"key":"2015102808332001000_58.11.2972.29","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2011.09.002"},{"key":"2015102808332001000_58.11.2972.30","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-014-1342-3"},{"key":"2015102808332001000_58.11.2972.31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2013.06.004"},{"key":"2015102808332001000_58.11.2972.32","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-009-0363-9"},{"key":"2015102808332001000_58.11.2972.33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.02.012"},{"key":"2015102808332001000_58.11.2972.34","doi-asserted-by":"publisher","DOI":"10.1002\/net.20389"},{"key":"2015102808332001000_58.11.2972.35","doi-asserted-by":"crossref","unstructured":"Lee H.-O. Kim J.-S. Oh E. Lim H.-S. (2002) Hyper-Star Graph: A New Interconnection Network Improving the Network Cost of the Hypercube. Proc. EurAsia ICT: Information and Communication Technology, Shiraz, Iran, October 29\u201331, Lecture Notes in Computer Science 2510, pp. 858\u2013865. Springer, Berlin.","DOI":"10.1007\/3-540-36087-5_99"},{"key":"2015102808332001000_58.11.2972.36","doi-asserted-by":"crossref","unstructured":"Kim J.-S. Oh E. Lee H.-O. Heo Y.-N. (2003) Topological and Communication Aspects of Hyper-Star Graphs. Proc. 18th Int. Symp. Computer and Information Sciences, Antalya, Turkey, November 3\u20135, Lecture Notes in Computer Science 2869, pp. 51\u201358. Springer, Berlin.","DOI":"10.1007\/978-3-540-39737-3_7"},{"key":"2015102808332001000_58.11.2972.37","doi-asserted-by":"crossref","unstructured":"Madabhushi S.V.R. Lakshmivarahan S. Dhall S.K. (1991) Analysis of the Modified Even Networks. Proc. 3rd IEEE Symp. Parallel and Distributed Processing, Dallas, TX, December 2\u20135, pp. 128\u2013131. IEEE Computer Society Press.","DOI":"10.1109\/SPDP.1991.218288"},{"key":"2015102808332001000_58.11.2972.38","unstructured":"Cheng E. Lipt\u00e1k L. (2006) Structural properties of hyper-stars. Ars Combin., 80, 65\u201373."},{"key":"2015102808332001000_58.11.2972.39","unstructured":"Cheng E. Shah M. (2006) A strong structural theorem for hyper-stars. Congr. Numer., 179, 181\u2013191."},{"key":"2015102808332001000_58.11.2972.40","doi-asserted-by":"publisher","DOI":"10.1080\/00207160701691431"},{"key":"2015102808332001000_58.11.2972.41","doi-asserted-by":"crossref","unstructured":"Bagga K.S. Owens F.W. (1989) Low Dimensional Middle Cubes are Hamiltonian. Proc. 1st Great Lakes Computer Science Conference on Computing in the 90's, Kalamazoo Michigan, October 18\u201320, Lecture Notes in Computer Science 507, pp. 8\u201314. Springer, Berlin.","DOI":"10.1007\/BFb0038466"},{"key":"2015102808332001000_58.11.2972.42","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054103001790"},{"key":"2015102808332001000_58.11.2972.43","doi-asserted-by":"publisher","DOI":"10.1109\/71.80187"},{"key":"2015102808332001000_58.11.2972.44","doi-asserted-by":"crossref","unstructured":"Krishnamoorthy M.S. Krishnamurthy B. (1987) Fault diameter of interconnection networks. Comput. Math. Appl., 5-6, 577\u2013582.","DOI":"10.1016\/0898-1221(87)90085-X"},{"key":"2015102808332001000_58.11.2972.45","unstructured":"Hsu D.F. (1994) On container width and length in graphs, groups, and networks. IEICE Trans. Fundam. Elect. Commun. Comput. Sci., E77-A, 668\u2013680."},{"key":"2015102808332001000_58.11.2972.46","doi-asserted-by":"crossref","unstructured":"Yang J.-S. Chang J.-M. Pai K.-J. Chan H.-C. (2015) Parallel construction of independent spanning trees on enhanced hypercubes. IEEE Trans. Parallel Distrib. Syst., doi:10.1109\/TPDS.2014.2367498 .","DOI":"10.1109\/TPDS.2014.2367498"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/58\/11\/2972\/5154551\/bxv029.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T00:27:41Z","timestamp":1566606461000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxv029"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,22]]},"references-count":46,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2015,10,28]]},"published-print":{"date-parts":[[2015,11]]}},"alternative-id":["10.1093\/comjnl\/bxv029"],"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxv029","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,22]]}}}