{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T20:56:08Z","timestamp":1720472168356},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61572337","61502328","61602333"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation, China","doi-asserted-by":"crossref","award":["2015M581858"],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Natural Science Foundation of the Jiangsu Higher Education Institutions of China","award":["14KJB520034","15KJB520032"]},{"name":"Jiangsu Planned Projects for Postdoctoral Research Funds, China","award":["1501089B"]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1016\/j.future.2018.02.010","type":"journal-article","created":{"date-parts":[[2018,2,12]],"date-time":"2018-02-12T12:31:45Z","timestamp":1518438705000},"page":"404-415","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":21,"special_numbering":"C","title":["Constructing independent spanning trees with height n<\/mml:mi><\/mml:math> on the n<\/mml:mi><\/mml:math>-dimensional crossed cube"],"prefix":"10.1016","volume":"87","author":[{"given":"Baolei","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Jianxi","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Qiang","family":"Lyu","sequence":"additional","affiliation":[]},{"given":"Jingya","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Zhao","family":"Liu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/j.future.2018.02.010_b1","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1109\/71.159036","article-title":"The crossed cube architecture for parallel computation","volume":"3","author":"Efe","year":"1992","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.future.2018.02.010_b2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.future.2015.06.008","article-title":"RingCube\u2014An incrementally scale-out optical interconnect for cloud computing data center","volume":"54","author":"Yu","year":"2016","journal-title":"Future Gener. Comput. Syst."},{"issue":"5","key":"10.1016\/j.future.2018.02.010_b3","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1109\/JLT.2013.2294863","article-title":"A hierarchical optical network-on-chip using central-controlled subnet and wavelength assignment","volume":"32","author":"Chen","year":"2014","journal-title":"J. Lightwave Technol."},{"issue":"2","key":"10.1016\/j.future.2018.02.010_b4","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.mejo.2012.12.008","article-title":"An energy- and buffer-aware fully adaptive routing algorithm for network-on-chip","volume":"44","author":"Wang","year":"2013","journal-title":"Microelectron. J."},{"issue":"1","key":"10.1016\/j.future.2018.02.010_b5","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/71.824643","article-title":"Edge congestion and topological properties of crossed cubes","volume":"11","author":"Chang","year":"2000","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"11","key":"10.1016\/j.future.2018.02.010_b6","doi-asserted-by":"crossref","first-page":"1312","DOI":"10.1109\/12.102840","article-title":"A variation on the hypercube with lower diameter","volume":"40","author":"Efe","year":"1991","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/j.future.2018.02.010_b7","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0020-0190(94)00167-W","article-title":"Multiply-twisted hypercube with five or more dimensions is not vertex-transitive","volume":"53","author":"Kulasinghe","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.future.2018.02.010_b8","unstructured":"P. Kulasinghe, S. Bettayeb, Symmetry of the Multiply-Twisted Hypercube, Technical Report No. Tr-94005, Dept. of Computer Science, Louisiana State Univ., Baton Rouge, La."},{"issue":"3","key":"10.1016\/j.future.2018.02.010_b9","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.ipl.2004.09.026","article-title":"Node-pancyclicity and edge-pancyclicity of crossed cubes","volume":"93","author":"Fan","year":"2005","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.future.2018.02.010_b10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.dam.2014.09.006","article-title":"The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks","volume":"181","author":"Hung","year":"2015","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.future.2018.02.010_b11","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.tcs.2016.04.007","article-title":"Paired many-to-many disjoint path covers in restricted hypercube-like graphs","volume":"634","author":"Park","year":"2016","journal-title":"Theoret. Comput. Sci."},{"issue":"7","key":"10.1016\/j.future.2018.02.010_b12","doi-asserted-by":"crossref","first-page":"2767","DOI":"10.1007\/s11227-015-1417-9","article-title":"2-disjoint-path-coverable panconnectedness of crossed cubes","volume":"71","author":"Chen","year":"2015","journal-title":"J. Supercomput."},{"key":"10.1016\/j.future.2018.02.010_b13","first-page":"796","article-title":"Reliable broadcasting and secure distributing in channel networks","volume":"E81-A","author":"Bao","year":"1998","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"1","key":"10.1016\/j.future.2018.02.010_b14","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0890-5401(88)90016-8","article-title":"The multi-tree approach to reliability in distributed networks","volume":"79","author":"Itai","year":"1988","journal-title":"Inform. Comput."},{"issue":"2","key":"10.1016\/j.future.2018.02.010_b15","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1002\/jgt.3190130205","article-title":"Three tree-paths","volume":"13","author":"Zehavi","year":"1989","journal-title":"J. Graph Theory"},{"issue":"5","key":"10.1016\/j.future.2018.02.010_b16","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1137\/S0097539703436734","article-title":"Finding four independent trees","volume":"35","author":"Curran","year":"2006","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.future.2018.02.010_b17","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01202468","article-title":"Independent trees in planar graphs","volume":"15","author":"Huck","year":"1999","journal-title":"Graphs Combin."},{"issue":"5","key":"10.1016\/j.future.2018.02.010_b18","first-page":"1102","article-title":"A linear-time algorithm to find independent spanning trees in maximal planar graphs","volume":"E84-A","author":"Nagai","year":"2001","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"11","key":"10.1016\/j.future.2018.02.010_b19","first-page":"1894","article-title":"Independent spanning trees of product graphs and their construction","volume":"E79-A","author":"Obokata","year":"1996","journal-title":"IEICE Trans. Fundamen. Electron. Commun. Comput. Sci."},{"issue":"1","key":"10.1016\/j.future.2018.02.010_b20","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TC.2009.98","article-title":"Independent spanning trees on multidimensional torus networks","volume":"59","author":"Tang","year":"2010","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/j.future.2018.02.010_b21","first-page":"143","article-title":"Optimal independent spanning trees on hypercubes","volume":"20","author":"Tang","year":"2004","journal-title":"J. Inf. Sci. Eng."},{"key":"10.1016\/j.future.2018.02.010_b22","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/j.ins.2013.01.010","article-title":"Independent spanning trees in crossed cubes","volume":"233","author":"Cheng","year":"2013","journal-title":"Inform. Sci."},{"issue":"5","key":"10.1016\/j.future.2018.02.010_b23","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/j.jpdc.2013.01.009","article-title":"Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes","volume":"73","author":"Cheng","year":"2013","journal-title":"J. Parallel Distrib. Comput."},{"issue":"11","key":"10.1016\/j.future.2018.02.010_b24","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1093\/comjnl\/bxs123","article-title":"Constructive algorithm of independent spanning trees on M\u00f6bius cubes","volume":"56","author":"Cheng","year":"2013","journal-title":"Comput. J."},{"issue":"3","key":"10.1016\/j.future.2018.02.010_b25","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1007\/s11227-014-1346-z","article-title":"A fully parallelized scheme of constructing independent spanning trees on M\u00f6bius cubes","volume":"71","author":"Yang","year":"2015","journal-title":"J. Supercomput."},{"issue":"14","key":"10.1016\/j.future.2018.02.010_b26","doi-asserted-by":"crossref","first-page":"3085","DOI":"10.1016\/j.ins.2011.02.019","article-title":"Embedding meshes into twisted-cubes","volume":"181","author":"Wang","year":"2011","journal-title":"Inform. Sci."},{"issue":"21","key":"10.1016\/j.future.2018.02.010_b27","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.tcs.2012.08.020","article-title":"An algorithm to construct independent spanning trees on parity cubes","volume":"465","author":"Wang","year":"2012","journal-title":"Theoret. Comput. Sci."},{"issue":"13","key":"10.1016\/j.future.2018.02.010_b28","doi-asserted-by":"crossref","first-page":"2892","DOI":"10.1016\/j.ins.2011.02.012","article-title":"Independent spanning trees on even networks","volume":"181","author":"Kim","year":"2011","journal-title":"Inform. Sci."},{"issue":"2","key":"10.1016\/j.future.2018.02.010_b29","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/s11227-009-0363-9","article-title":"Optimal independent spanning trees on odd graphs","volume":"56","author":"Kim","year":"2011","journal-title":"J. Supercomput."},{"issue":"11","key":"10.1016\/j.future.2018.02.010_b30","doi-asserted-by":"crossref","first-page":"3090","DOI":"10.1109\/TPDS.2014.2367498","article-title":"Parallel construction of independent spanning trees on enhanced hypercubes","volume":"26","author":"Yang","year":"2015","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"10.1016\/j.future.2018.02.010_b31","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1093\/comjnl\/bxw054","article-title":"Independent spanning trees in RTCC-pyramids","volume":"60","author":"Wang","year":"2017","journal-title":"Comput. J."},{"issue":"5","key":"10.1016\/j.future.2018.02.010_b32","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TPDS.2007.351709","article-title":"Reducing the height of independent spanning trees in chordal rings","volume":"18","author":"Yang","year":"2007","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"7","key":"10.1016\/j.future.2018.02.010_b33","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1109\/12.392850","article-title":"Embedding binary trees into crossed cubes","volume":"44","author":"Kulasinghe","year":"1995","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/j.future.2018.02.010_b34","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1080\/0020716042000301752","article-title":"The locally twisted cubes","volume":"82","author":"Yang","year":"2005","journal-title":"Int. J. Comput. Math."},{"issue":"5","key":"10.1016\/j.future.2018.02.010_b35","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1109\/12.381950","article-title":"The M\u00f6bius cubes","volume":"44","author":"Larson","year":"1995","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/j.future.2018.02.010_b36","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0743-7315(91)90113-N","article-title":"The twisted cube topology for multiprocessors: a study in network asymmetry","volume":"13","author":"Abraham","year":"1991","journal-title":"J. Parallel Distrib. Comput."}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X18302723?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X18302723?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T19:13:26Z","timestamp":1579029206000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X18302723"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":36,"alternative-id":["S0167739X18302723"],"URL":"https:\/\/doi.org\/10.1016\/j.future.2018.02.010","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2018,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Constructing independent spanning trees with height on the -dimensional crossed cube","name":"articletitle","label":"Article Title"},{"value":"Future Generation Computer Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.future.2018.02.010","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}
