{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T02:41:02Z","timestamp":1768272062384,"version":"3.49.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T00:00:00Z","timestamp":1465776000000},"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":["J Supercomput"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s11227-016-1768-x","type":"journal-article","created":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T04:51:27Z","timestamp":1465793487000},"page":"4718-4736","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Edge-disjoint node-independent spanning trees in dense Gaussian networks"],"prefix":"10.1007","volume":"72","author":[{"given":"Bader","family":"AlBdaiwi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zaid","family":"Hussain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anton","family":"Cerny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Aldred","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,13]]},"reference":[{"issue":"2","key":"1768_CR1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1093\/comjnl\/bxt142","volume":"58","author":"O Alsaleh","year":"2015","unstructured":"Alsaleh O, Bose B, Hamdaoui B (2015) One-to-many node-disjoint paths routing in dense gaussian networks. Comput J 58(2):173\u2013187","journal-title":"Comput J"},{"issue":"3","key":"1768_CR2","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF00130109","volume":"10","author":"H Arabnia","year":"1996","unstructured":"Arabnia H, Bhandarkar S (1996) Parallel stereocorrelation on a reconfigurable multi-ring network. J Supercomput 10(3):243\u2013269","journal-title":"J Supercomput"},{"key":"1768_CR3","unstructured":"Arabnia HR, Smith JW (1993) A reconfigurable interconnection network for imaging operations and its implementation using a multi-stage switching box. In: The Proceedings of the 7th annual international high performance computing conference. Calgary, Alberta, Canada, pp 349\u2013357"},{"issue":"1\u20133","key":"1768_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(97)00100-5","volume":"83","author":"F Bao","year":"1998","unstructured":"Bao F, Igarashi Y, \u00d6hring SR (1998) Reliable broadcasting in product networks. Discrete Appl Math 83(1\u20133):3\u201320","journal-title":"Discrete Appl Math"},{"issue":"8","key":"1768_CR5","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1109\/TC.1968.229158","volume":"17","author":"GH Barnes","year":"1968","unstructured":"Barnes GH, Brown RM, Kato M, Kuck DJ, Slotnick DL, Stokes R (1968) The ILLIAC IV computer. IEEE Trans Comput C 17(8):746\u2013757","journal-title":"IEEE Trans Comput C"},{"issue":"10","key":"1768_CR6","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1109\/12.93744","volume":"40","author":"R Beivide","year":"1991","unstructured":"Beivide R, Herrada E, Balc\u00e1zar JL, Arruabarrena A (1991) Optimal distance networks of low degree for parallel computers. IEEE Trans Comput 40(10):1109\u20131124. doi: 10.1109\/12.93744","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"1768_CR7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1006\/jpdc.1995.1011","volume":"24","author":"S Bhandarkar","year":"1995","unstructured":"Bhandarkar S, Arabnia H (1995) The hough transform on a reconfigurable multi-ring network. J Parallel Distrib Comput 24(1):107\u2013114","journal-title":"J Parallel Distrib Comput"},{"issue":"11","key":"1768_CR8","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":"02","key":"1768_CR9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1142\/S0218001495000110","volume":"09","author":"SM Bhandarkar","year":"1995","unstructured":"Bhandarkar SM, Arabnia HR, Smith JW (1995) A reconfigurable architecture for image processing and computer vision. Int J Pattern Recognit Artif Intell 09(02):201\u2013229","journal-title":"Int J Pattern Recognit Artif Intell"},{"issue":"8","key":"1768_CR10","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1109\/12.403718","volume":"44","author":"B Bose","year":"1995","unstructured":"Bose B, Broeg B, Kwon Y, Ashir Y (1995) Lee distance and topological properties of k-ary n-cubes. IEEE Trans Comput 44(8):1021\u20131030","journal-title":"IEEE Trans Comput"},{"key":"1768_CR11","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/j.amc.2015.06.081","volume":"268","author":"YH Chang","year":"2015","unstructured":"Chang YH, Yang JS, Chang JM, Wang YL (2015) A fast parallel algorithm for constructing independent spanning trees on parity cubes. Appl Math Comput 268:489\u2013495","journal-title":"Appl Math Comput"},{"issue":"1","key":"1768_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1109\/TPDS.2014.2307871","volume":"26","author":"B Cheng","year":"2015","unstructured":"Cheng B, Fan J, Jia X (2015) Dimensional-permutation-based independent spanning trees in bijective connection networks. IEEE Trans Parallel Distrib Syst 26(1):45\u201353. doi: 10.1109\/TPDS.2014.2307871","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1768_CR13","volume-title":"Principles and practices of interconnection networks","author":"WJ, Dally","year":"2004","unstructured":"Dally WJ, Towles BP (2004) Principles and practices of interconnection networks. Elsevier, San Francisco, CA, USA"},{"key":"1768_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78348-7_13","volume-title":"Intel Paragon XP\/S-Architecture and software environment","author":"R Esser","year":"1993","unstructured":"Esser R, Knecht R (1993) Intel Paragon XP\/S-Architecture and software environment. Springer, Berlin Heidelberg"},{"issue":"8","key":"1768_CR15","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1109\/TPDS.2009.132","volume":"21","author":"M Flahive","year":"2010","unstructured":"Flahive M, Bose B (2010) The topology of Gaussian and Eisenstein\u2013Jacobi interconnection networks. IEEE Trans Parallel Distrib Syst 21(8):1132\u20131142. doi: 10.1109\/TPDS.2009.132","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"1768_CR16","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/12.485370","volume":"45","author":"P Fragopoulou","year":"1996","unstructured":"Fragopoulou P, Akl SG (1996) Edge-disjoint spanning trees on the star network with applications to fault tolerance. IEEE Trans Comput 45(2):174\u2013185. doi: 10.1109\/12.485370","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"1768_CR17","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 (1988) The multi-tree approach to reliability in distributed networks. Inf Comput 79(1):43\u201359. doi: 10.1016\/0890-5401(88)90016-8","journal-title":"Inf Comput"},{"issue":"1","key":"1768_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2688007","volume":"38","author":"J Jordan","year":"1965","unstructured":"Jordan J, Potratz C (1965) Complete residue systems in the Gaussian integers. Math Mag 38(1):1\u201312","journal-title":"Math Mag"},{"issue":"4","key":"1768_CR19","first-page":"379","volume":"15","author":"L Kong","year":"2006","unstructured":"Kong L, Ali M, Deogun JS (2006) Building redundant multicast trees for preplanned recovery in WDM optical networks. J High Speed Netw 15(4):379\u2013398","journal-title":"J High Speed Netw"},{"key":"1768_CR20","volume-title":"Introduction to parallel algorithms and architectures: arrays, trees, hypercubes","author":"FT Leighton","year":"1992","unstructured":"Leighton FT (1992) Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kauffman, San Francisco, CA, USA"},{"issue":"10","key":"1768_CR21","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1016\/j.ipl.2010.03.012","volume":"110","author":"JC Lin","year":"2010","unstructured":"Lin JC, Yang JS, Hsu CC, Chang JM (2010) Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes. Inf Process Lett 110(10):414\u2013419. doi: 10.1016\/j.ipl.2010.03.012","journal-title":"Inf Process Lett"},{"issue":"8","key":"1768_CR22","doi-asserted-by":"crossref","first-page":"1046","DOI":"10.1109\/TC.2008.57","volume":"57","author":"C Martinez","year":"2008","unstructured":"Martinez C, Beivide R, Stafford E, Moreto M, Gabidulin EM (2008) Modeling toroidal networks with the Gaussian integers. IEEE Trans Comput 57(8):1046\u20131056","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"1768_CR23","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/TC.2008.57","volume":"34","author":"C Mart\u00ednez","year":"2006","unstructured":"Mart\u00ednez C, Vallejo E, Beivide R, Izu C, Moret\u00f3 M (2006) Dense Gaussian networks: suitable topologies for on-chip multiprocessors. Int J Parallel Program 34(3):193\u2013211. doi: 10.1109\/TC.2008.57","journal-title":"Int J Parallel Program"},{"key":"1768_CR24","doi-asserted-by":"publisher","unstructured":"Ncube C (1988) The ncube family of high-performance parallel computer systems. In: Proceedings of the Third Conference on Hypercube Concurrent Computers and Applications: Architecture, Software, Computer Systems, and General Issues, vol 1, C3P. ACM, New York, NY, USA, pp 847\u2013851. doi: 10.1145\/62297.62415","DOI":"10.1145\/62297.62415"},{"key":"1768_CR25","unstructured":"Research IC (1993) Cray T3D system architecture overview manual"},{"key":"1768_CR26","unstructured":"Scott SL, Thorson GM (1996) The cray T3E network: adaptive routing in a high performance 3D torus. In: Proceedings of the hot interconnects IV, August 1996, pp 157\u2013160"},{"issue":"1","key":"1768_CR27","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/2465.2467","volume":"28","author":"CL Seitz","year":"1985","unstructured":"Seitz CL (1985) The cosmic cube. Commun ACM 28(1):22\u201333","journal-title":"Commun ACM"},{"key":"1768_CR28","doi-asserted-by":"publisher","unstructured":"Shamaei, A, Bose, B, Flahive, M (2014) Higher dimensional Gaussian networks. In: Proceedings of the 2014 IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW \u201914, pp 1438\u20131447. IEEE Computer Society, Washington, DC, USA. doi: 10.1109\/IPDPSW.2014.161","DOI":"10.1109\/IPDPSW.2014.161"},{"key":"1768_CR29","doi-asserted-by":"publisher","unstructured":"Slotnick, DL, Borck, WC, McReynolds, RC (1962) The solomon computer. In: Proceedings of the December 4-6, 1962, Fall Joint Computer Conference, AFIPS \u201962 (Fall). ACM, New York, NY, USA, pp 97\u2013107. doi: 10.1145\/1461518.1461528","DOI":"10.1145\/1461518.1461528"},{"issue":"4","key":"1768_CR30","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/S0167-8191(02)00073-X","volume":"28","author":"A Touzene","year":"2002","unstructured":"Touzene A (2002) Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance. Parallel Comput 28(4):649\u2013666. doi: 10.1016\/S0167-8191(02)00073-X","journal-title":"Parallel Comput"},{"issue":"4","key":"1768_CR31","doi-asserted-by":"crossref","first-page":"1085","DOI":"10.1109\/TPDS.2014.2314689","volume":"26","author":"A Touzene","year":"2015","unstructured":"Touzene A (2015) On all-to-all broadcast in dense Gaussian network on-chip. IEEE Trans Parallel Distrib Syst 26(4):1085\u20131095","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"11","key":"1768_CR32","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1016\/j.jpdc.2005.05.009","volume":"65","author":"A Touzene","year":"2005","unstructured":"Touzene A, Day K, Monien B (2005) Edge-disjoint spanning trees for the generalized butterfly networks and their applications. J Parallel Distrib Comput 65(11):1384\u20131396. doi: 10.1016\/j.jpdc.2005.05.009","journal-title":"J Parallel Distrib Comput"},{"key":"1768_CR33","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/71.744837","volume":"10","author":"YC Tseng","year":"1996","unstructured":"Tseng YC, Wang SY, Ho CW (1996) Efficient broadcasting in wormhole-routed multicomputers: a network-partitioning approach. IEEE Trans Parallel Distrib Syst 10:44\u201361","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"9","key":"1768_CR34","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1006\/jpdc.2001.1751","volume":"61","author":"H Wang","year":"2001","unstructured":"Wang H, Blough DM (2001) Multicast in wormhole-switched torus networks using edge-disjoint spanning trees. J Parallel Distrib Comput 61(9):1278\u20131306. doi: 10.1006\/jpdc.2001.1751","journal-title":"J Parallel Distrib Comput"},{"issue":"4","key":"1768_CR35","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1145\/1498765.1498785","volume":"52","author":"S Williams","year":"2009","unstructured":"Williams S, Waterman A, Patterson D (2009) Roofline: an insightful visual performance model for multicore architectures. Commun ACM 52(4):65\u201376","journal-title":"Commun ACM"},{"issue":"12","key":"1768_CR36","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1016\/j.dam.2011.04.014","volume":"159","author":"JS Yang","year":"2011","unstructured":"Yang JS, Chan HC, Chang JM (2011) Broadcasting secure messages via optimal independent spanning trees in folded hypercubes. Discrete Appl Math 159(12):1254\u20131263. doi: 10.1016\/j.dam.2011.04.014","journal-title":"Discrete Appl Math"},{"issue":"1","key":"1768_CR37","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1093\/comjnl\/bxs157","volume":"57","author":"JS Yang","year":"2014","unstructured":"Yang JS, Chang JM (2014) Optimal independent spanning trees on cartesian product of hybrid graphs. Comput J 57(1):93\u201399","journal-title":"Comput J"},{"key":"1768_CR38","doi-asserted-by":"publisher","unstructured":"Yang, JS, Chang, JM, Chan, HC (2009) Independent spanning trees on folded hypercubes. In: Proceedings of the 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks, ISPAN \u201909. IEEE Computer Society, Washington, DC, USA, pp. 601\u2013605. doi: 10.1109\/I-SPAN.2009.55","DOI":"10.1109\/I-SPAN.2009.55"},{"issue":"11","key":"1768_CR39","doi-asserted-by":"publisher","first-page":"3090","DOI":"10.1109\/TPDS.2014.2367498","volume":"26","author":"JS Yang","year":"2015","unstructured":"Yang JS, Chang JM, Pai KJ, Chan HC (2015) Parallel construction of independent spanning trees on enhanced hypercubes. IEEE Trans Parallel Distrib Syst 26(11):3090\u20133098. doi: 10.1109\/TPDS.2014.2367498","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"3","key":"1768_CR40","doi-asserted-by":"publisher","first-page":"952","DOI":"10.1007\/s11227-014-1346-z","volume":"71","author":"JS Yang","year":"2015","unstructured":"Yang JS, Wu MR, Chang JM, Chang YH (2015) A fully parallelized scheme of constructing independent spanning trees on Mobius cubes. J Supercomput 71(3):952\u2013965. doi: 10.1007\/s11227-014-1346-z","journal-title":"J Supercomput"},{"issue":"10","key":"1768_CR41","doi-asserted-by":"crossref","first-page":"1959","DOI":"10.1109\/TC.2012.126","volume":"62","author":"Z Zhang","year":"2013","unstructured":"Zhang Z, Guo Z, Yang Y (2013) Efficient all-to-all broadcast in Gaussian on-chip networks. IEEE Trans Comput 62(10):1959\u20131971","journal-title":"IEEE Trans Comput"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1768-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-016-1768-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1768-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T15:29:43Z","timestamp":1718638183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-016-1768-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,13]]},"references-count":41,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["1768"],"URL":"https:\/\/doi.org\/10.1007\/s11227-016-1768-x","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,13]]}}}