{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T09:15:43Z","timestamp":1790500543509,"version":"4.1.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,11,26]],"date-time":"2014-11-26T00:00:00Z","timestamp":1416960000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s11227-014-1346-z","type":"journal-article","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T14:46:43Z","timestamp":1417445203000},"page":"952-965","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["A fully parallelized scheme of constructing independent spanning trees on M\u00f6bius cubes"],"prefix":"10.1007","volume":"71","author":[{"given":"Jinn-Shyong","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meng-Ru","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jou-Ming","family":"Chang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu-Huei","family":"Chang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,11,26]]},"reference":[{"issue":"2","key":"1346_CR1","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/0743-7315(90)90028-N","volume":"10","author":"HR Arabnia","year":"1990","unstructured":"Arabnia HR (1990) A parallel algorithm for the arbitrary rotation of digitized images using process-and-data-decomposition approach. J Parallel Distrib Comput 10(2):188\u2013192","journal-title":"J Parallel Distrib Comput"},{"key":"1346_CR2","unstructured":"Arabnia HR, Smith JW (1993) A reconfigurable interconnection network for imaging operations and its implementation using a multi-stage switching box. In: Proceedings of the 7th annual international high performance computing conference. Calgary, Alberta, Canada, pp 349\u2013357"},{"key":"1346_CR3","unstructured":"Bao F, Funyu Y, Hamada Y, Igarashi Y (1998) Reliable broadcasting and secure distributing in channel networks. IEICE Trans Fundam Electron Commun Comput Sci E81-A(5):796\u2013806"},{"issue":"11","key":"1346_CR4","doi-asserted-by":"crossref","first-page":"1783","DOI":"10.1016\/0167-8191(95)00032-9","volume":"21","author":"SM Bhandarkar","year":"1995","unstructured":"Bhandarkar SM, Arabnia HR (1995) The REFINE multiprocessor: theoretical properties and algorithms. Parallel Comput 21(11):1783\u20131805","journal-title":"Parallel Comput"},{"issue":"12","key":"1346_CR5","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1016\/j.ipl.2014.06.015","volume":"114","author":"J-M Chang","year":"2014","unstructured":"Chang J-M, Wang J-D, Yang J-S, Pai K-J (2014) A comment on \u201cIndependent spanning trees in crossed cubes\u201d. Inf Process Lett 114(12):734\u2013739","journal-title":"Inf Process Lett"},{"issue":"5","key":"1346_CR6","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/j.ipl.2010.11.018","volume":"111","author":"X-B Chen","year":"2011","unstructured":"Chen X-B (2011) Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs. Inf Process Lett 111(5):235\u2013238","journal-title":"Inf Process Lett"},{"issue":"3","key":"1346_CR7","doi-asserted-by":"crossref","first-page":"1279","DOI":"10.1007\/s11227-013-0883-1","volume":"65","author":"B Cheng","year":"2013","unstructured":"Cheng B, Fan J, Jia X, Jia J (2013) Parallel construction of independent spanning trees and an application in diagnosis on M\u00f6bius cubes. J Supercomput 65(3):1279\u20131301","journal-title":"J Supercomput"},{"issue":"5","key":"1346_CR8","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/j.jpdc.2013.01.009","volume":"73","author":"B Cheng","year":"2013","unstructured":"Cheng B, Fan J, Jia X, Wang J (2013) Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes. J Parallel Distrib Comput 73(5):641\u2013652","journal-title":"J Parallel Distrib Comput"},{"key":"1346_CR9","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/j.ins.2013.01.010","volume":"233","author":"B Cheng","year":"2013","unstructured":"Cheng B, Fan J, Jia X, Zhang S (2013) Independent spanning trees in crossed cubes. Inf Sci 233:276\u2013289","journal-title":"Inf Sci"},{"issue":"11","key":"1346_CR10","doi-asserted-by":"crossref","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(11):1347\u20131362","journal-title":"Comput J"},{"issue":"4","key":"1346_CR11","doi-asserted-by":"crossref","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(4):507\u2013537","journal-title":"J Algorithms"},{"issue":"5","key":"1346_CR12","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1109\/12.381950","volume":"44","author":"P Cull","year":"1995","unstructured":"Cull P, Larson SL (1995) The M\u00f6bius cubes. IEEE Trans Comput 44(5):647\u2013659","journal-title":"IEEE Trans Comput"},{"issue":"5","key":"1346_CR13","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1137\/S0097539703436734","volume":"35","author":"S Curran","year":"2006","unstructured":"Curran S, Lee O, Yu X (2006) Finding four independent trees. SIAM J Comput 35(5):1023\u20131058","journal-title":"SIAM J Comput"},{"issue":"9","key":"1346_CR14","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1109\/71.722224","volume":"9","author":"J Fan","year":"1998","unstructured":"Fan J (1998) Diagnosability of the M\u00f6bius cubes. IEEE Trans Parallel Distrib Syst 9(9):923\u2013928","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"1346_CR15","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0020-0190(01)00256-3","volume":"82","author":"J Fan","year":"2002","unstructured":"Fan J (2002) Hamilton-connectivity and cycle-embedding of the M\u00f6bius cubes. Inf Process Lett 82(2):113\u2013117","journal-title":"Inf Process Lett"},{"issue":"7","key":"1346_CR16","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1109\/TC.2006.104","volume":"55","author":"S-Y Hsieh","year":"2006","unstructured":"Hsieh S-Y, Chang N-W (2006) Hamiltonian path embedding and pancyclicity on the M\u00f6bius cube with faulty nodes and faulty edges. IEEE Trans Comput 55(7):854\u2013863","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"1346_CR17","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/j.parco.2003.12.003","volume":"30","author":"S-Y Hsieh","year":"2004","unstructured":"Hsieh S-Y, Chen C-H (2004) Pancyclicity on M\u00f6bius cubes with maximal edge faults. Parallel Comput 30(3):407\u2013421","journal-title":"Parallel Comput"},{"issue":"1","key":"1346_CR18","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01202468","volume":"10","author":"A Huck","year":"1994","unstructured":"Huck A (1994) Independent trees in graphs. Gr Comb 10(1):29\u201345","journal-title":"Gr Comb"},{"issue":"1","key":"1346_CR19","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/PL00021190","volume":"15","author":"A Huck","year":"1999","unstructured":"Huck A (1999) Independent trees in planar graphs. Gr Comb 15(1):29\u201377","journal-title":"Gr Comb"},{"issue":"1","key":"1346_CR20","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0890-5401(88)90016-8","volume":"79","author":"A Itai","year":"1988","unstructured":"Itai A, Rodeh M (1988) The multi-tree approach to reliability in distributed networks. Inf Comput 79(1):43\u201359","journal-title":"Inf Comput"},{"issue":"3","key":"1346_CR21","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0020-0190(98)00205-1","volume":"69","author":"Y Iwasaki","year":"1999","unstructured":"Iwasaki Y, Kajiwara Y, Obokata K, Igarashi Y (1999) Independent spanning trees of chordal rings. Inf Process Lett 69(3):155\u2013160","journal-title":"Inf Process Lett"},{"issue":"2","key":"1346_CR22","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/s11227-009-0363-9","volume":"56","author":"J-S Kim","year":"2011","unstructured":"Kim J-S, Lee H-O, Cheng E, Lipt\u00e1k L (2011) Optimal independent spanning trees on odd graphs. J Supercomput 56(2):212\u2013225","journal-title":"J Supercomput"},{"issue":"13","key":"1346_CR23","doi-asserted-by":"crossref","first-page":"2892","DOI":"10.1016\/j.ins.2011.02.012","volume":"181","author":"J-S Kim","year":"2011","unstructured":"Kim J-S, Lee H-O, Cheng E, Lipt\u00e1k L (2011) Independent spanning trees on even networks. Inf Sci 181(13):2892\u20132905","journal-title":"Inf Sci"},{"issue":"22","key":"1346_CR24","doi-asserted-by":"crossref","first-page":"2237","DOI":"10.1016\/j.tcs.2010.12.061","volume":"412","author":"Y-J Liu","year":"2011","unstructured":"Liu Y-J, Lan JK, Chou WY, Chen C (2011) Constructing independent spanning trees for locally twisted cubes. Theor Comput Sci 412(22):2237\u20132252","journal-title":"Theor Comput Sci"},{"issue":"2","key":"1346_CR25","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1142\/S0129054199000149","volume":"10","author":"K Miura","year":"1999","unstructured":"Miura K, Nakano S, Nishizeki T, Takahashi D (1999) A linear-time algorithm to find four independent spanning trees in four connected planar graphs. Int J Found Comput Sci 10(2):195\u2013210","journal-title":"Int J Found Comput Sci"},{"key":"1346_CR26","unstructured":"Nagai S, Nakano S (2001) A linear-time algorithm to find independent spanning trees in maximal planar graphs. IEICE Trans Fundam Electron Commun Comput Sci E84-A(5):1102\u20131109"},{"key":"1346_CR27","unstructured":"Obokata K, Iwasaki Y, Bao F, Igarashi Y (1996) Independent spanning trees of product graphs and their construction. IEICE Trans Fundam Electron Commun Comput Sci E79-A(11):1894\u20131903"},{"key":"1346_CR28","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/S0020-0255(01)00121-9","volume":"137","author":"AA Rescigno","year":"2001","unstructured":"Rescigno AA (2001) Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security. Inf Sci 137:259\u2013276","journal-title":"Inf Sci"},{"issue":"1","key":"1346_CR29","first-page":"143","volume":"20","author":"S-M Tang","year":"2004","unstructured":"Tang S-M, Wang Y-L, Leu Y-H (2004) Optimal independent spanning trees on hypercubes. J Inf Sci Eng 20(1):143\u2013155","journal-title":"J Inf Sci Eng"},{"issue":"1","key":"1346_CR30","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TC.2009.98","volume":"59","author":"S-M Tang","year":"2010","unstructured":"Tang S-M, Yang J-S, Wang Y-L, Chang J-M (2010) Independent spanning trees on multidimensional torus networks. IEEE Trans Comput 59(1):93\u2013102","journal-title":"IEEE Trans Comput"},{"key":"1346_CR31","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.tcs.2008.04.023","volume":"401","author":"C-H Tsai","year":"2008","unstructured":"Tsai C-H (2008) Embedding of meshes in M\u00f6bius cubes. Theor Comput Sci 401:181\u2013190","journal-title":"Theor Comput Sci"},{"issue":"1","key":"1346_CR32","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.jpdc.2011.09.002","volume":"72","author":"Y Wang","year":"2012","unstructured":"Wang Y, Fan J, Zhou G, Jia X (2012) Independent spanning trees on twisted cubes. J Parallel Distrib Comput 72(1):58\u201369","journal-title":"J Parallel Distrib Comput"},{"key":"1346_CR33","doi-asserted-by":"crossref","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"},{"issue":"12","key":"1346_CR34","doi-asserted-by":"crossref","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 (2012) An efficient parallel construction of optimal independent spanning trees on hypercubes. J Parallel Distrib Comput 72(12):1713\u20131724","journal-title":"J Parallel Distrib Comput"},{"issue":"4","key":"1346_CR35","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.ipl.2005.07.003","volume":"96","author":"M Xu","year":"2005","unstructured":"Xu M, Xu J-M (2005) Edge-pancyclicity of M\u00f6bius cubes. Inf Process Lett 96(4):136\u2013140","journal-title":"Inf Process Lett"},{"issue":"1","key":"1346_CR36","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1142\/S0219265905001319","volume":"6","author":"J-M Xu","year":"2005","unstructured":"Xu J-M, Deng ZG (2005) Wide diameter of M\u00f6bius cubes. J Interconnect Netw 6(1):51\u201362","journal-title":"J Interconnect Netw"},{"issue":"3","key":"1346_CR37","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.ipl.2005.09.015","volume":"97","author":"J-M Xu","year":"2006","unstructured":"Xu J-M, Ma M, L\u00fc M (2006) Paths in M\u00f6bius cubes and crossed cubes. Inf Process Lett 97(3):94\u201397","journal-title":"Inf Process Lett"},{"issue":"12","key":"1346_CR38","doi-asserted-by":"crossref","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 (2011) Broadcasting secure messages via optimal independent spanning trees in folded hypercubes. Discrete Appl Math 159(12):1254\u20131263","journal-title":"Discrete Appl Math"},{"issue":"4","key":"1346_CR39","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1002\/net.20389","volume":"56","author":"J-S Yang","year":"2010","unstructured":"Yang J-S, Chang J-M (2010) Independent spanning trees on folded hyper-stars. Networks 56(4):272\u2013281","journal-title":"Networks"},{"issue":"1","key":"1346_CR40","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1093\/comjnl\/bxs157","volume":"57","author":"J-S Yang","year":"2014","unstructured":"Yang J-S, Chang J-M (2014) Optimal independent spanning trees on Cartesian product of hybrid graphs. Comput J 57(1):93\u201399","journal-title":"Comput J"},{"issue":"5","key":"1346_CR41","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TPDS.2007.351709","volume":"18","author":"J-S Yang","year":"2007","unstructured":"Yang J-S, Chang J-M, Tang S-M, Wang Y-L (2007) Reducing the height of independent spanning trees in chordal rings. IEEE Trans Parallel Distrib Syst 18(5):644\u2013657","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"21\u201323","key":"1346_CR42","doi-asserted-by":"crossref","first-page":"2001","DOI":"10.1016\/j.tcs.2008.12.042","volume":"410","author":"J-S Yang","year":"2009","unstructured":"Yang J-S, Chang J-M, Tang S-M, Wang Y-L (2009) On the independent spanning trees of recursive circulant graphs $$G(cd^m, d)$$ G ( c d m , d ) with $$d>2$$ d > 2 . Theor Comput Sci 410(21\u201323):2001\u20132010","journal-title":"Theor Comput Sci"},{"issue":"1","key":"1346_CR43","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1142\/S0129054110007143","volume":"21","author":"J-S Yang","year":"2010","unstructured":"Yang J-S, Chang J-M, Tang S-M, Wang Y-L (2010) Constructing multiple independent spanning trees on recursive circulant graphs $$G(2^m,2)$$ G ( 2 m , 2 ) . Int J Found Comput Sci 21(1):73\u201390","journal-title":"Int J Found Comput Sci"},{"issue":"1","key":"1346_CR44","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.parco.2006.12.001","volume":"33","author":"J-S Yang","year":"2007","unstructured":"Yang J-S, Tang S-M, Chang J-M, Wang Y-L (2007) Parallel construction of optimal independent spanning trees on hypercubes. Parallel Comput 33(1):73\u201379","journal-title":"Parallel Comput"},{"key":"1346_CR45","doi-asserted-by":"crossref","unstructured":"Yang J-S, Wu M-R, Chang J-M, Chang Y-H (2014) Open source for \u201cConstructing independent spanning trees on M\u00f6bius cubes\u201d. http:\/\/ms.ntub.edu.tw\/~spade\/IST-MQ","DOI":"10.1007\/s11227-014-1346-z"},{"key":"1346_CR46","doi-asserted-by":"crossref","unstructured":"Yang M-C, Li T-K, Tan JM, Hsu L-H (2005) Fault-tolerant pancyclicity of the M\u00f6bius cubes. IEICE Trans Fundam Electron Commun Comput Sci E88-A(1):346\u2013352","DOI":"10.1093\/ietfec\/E88-A.1.346"},{"issue":"3","key":"1346_CR47","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.micpro.2005.11.001","volume":"30","author":"X Yang","year":"2006","unstructured":"Yang X, Megson GM, Evens DJ (2006) Pancyclicity of M\u00f6bius cubes with faulty nodes. Microprocess Microsyst 30(3):165\u2013172","journal-title":"Microprocess Microsyst"},{"issue":"2","key":"1346_CR48","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1002\/jgt.3190130205","volume":"13","author":"A Zehavi","year":"1989","unstructured":"Zehavi A, Itai A (1989) Three tree-paths. J Graph Theory 13(2):175\u2013188","journal-title":"J Graph Theory"},{"issue":"18","key":"1346_CR49","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/j.ipl.2013.06.004","volume":"113","author":"Y-H Zhang","year":"2013","unstructured":"Zhang Y-H, Hao W, Xiang T (2013) Independent spanning trees in crossed cubes. Inf Process Lett 113(18):653\u2013658","journal-title":"Inf Process Lett"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1346-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-014-1346-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1346-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,30]],"date-time":"2023-07-30T10:29:56Z","timestamp":1690712996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-014-1346-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,26]]},"references-count":49,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["1346"],"URL":"https:\/\/doi.org\/10.1007\/s11227-014-1346-z","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,26]]}}}