{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T06:13:33Z","timestamp":1768284813095,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2022,2,28]],"date-time":"2022-02-28T00:00:00Z","timestamp":1646006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,28]],"date-time":"2022-02-28T00:00:00Z","timestamp":1646006400000},"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,7]]},"DOI":"10.1007\/s11227-022-04351-4","type":"journal-article","created":{"date-parts":[[2022,2,28]],"date-time":"2022-02-28T14:03:51Z","timestamp":1646057031000},"page":"12114-12135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Independent spanning trees in Eisenstein\u2013Jacobi networks"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1955-2871","authenticated-orcid":false,"given":"Zaid","family":"Hussain","sequence":"first","affiliation":[]},{"given":"Hosam","family":"AboElFotoh","sequence":"additional","affiliation":[]},{"given":"Bader","family":"AlBdaiwi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,28]]},"reference":[{"issue":"1","key":"4351_CR1","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","journal-title":"Inf Comput"},{"issue":"5","key":"4351_CR2","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/0898-1221(87)90085-X","volume":"13","author":"M Krishnamoorthy","year":"1987","unstructured":"Krishnamoorthy M, Krishnamurthy B (1987) Fault diameter of interconnection networks. Comput Math Appl 13(5):577\u2013582","journal-title":"Comput Math Appl"},{"issue":"1","key":"4351_CR3","doi-asserted-by":"publisher","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(1):259\u2013276","journal-title":"Inf Sci"},{"issue":"12","key":"4351_CR4","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. Discret Appl Math 159(12):1254\u20131263","journal-title":"Discret Appl Math"},{"key":"4351_CR5","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.dam.2017.11.018","volume":"236","author":"B Darties","year":"2018","unstructured":"Darties B, Gastineau N, Togni O (2018) Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees. Discret Appl Math 236:124\u2013136","journal-title":"Discret Appl Math"},{"issue":"1","key":"4351_CR6","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.20460","volume":"60","author":"T Hasunuma","year":"2012","unstructured":"Hasunuma T, Morisaka C (2012) Completely independent spanning trees in torus networks. Networks 60(1):59\u201369","journal-title":"Networks"},{"issue":"1","key":"4351_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1109\/TC.2009.98","volume":"59","author":"SM Tang","year":"2010","unstructured":"Tang SM, Yang JS, Wang YL, Chang JM (2010) Independent spanning trees on multidimensional torus networks. IEEE Trans Comput 59(1):93\u2013102","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"4351_CR8","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1109\/TPDS.2003.1189580","volume":"14","author":"SC Ku","year":"2003","unstructured":"Ku SC, Wang BF, Hung TK (2003) Constructing edge-disjoint spanning trees in product networks. IEEE Trans Parallel Distrib Syst 14(3):213\u2013221","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"4351_CR9","doi-asserted-by":"publisher","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"},{"issue":"1","key":"4351_CR10","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\u2013156","journal-title":"J Inf Sci Eng"},{"issue":"3","key":"4351_CR11","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 M\u00f6bius cubes. J Supercomput 71(3):952\u2013965","journal-title":"J Supercomput"},{"key":"4351_CR12","first-page":"489","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":"4351_CR13","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","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"4351_CR14","doi-asserted-by":"publisher","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":"4351_CR15","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.dam.2016.11.017","volume":"219","author":"JM Chang","year":"2017","unstructured":"Chang JM, Yang TJ, Yang JS (2017) A parallel algorithm for constructing independent spanning trees in twisted cubes. Discret Appl Math 219:74\u201382","journal-title":"Discret Appl Math"},{"key":"4351_CR16","doi-asserted-by":"publisher","first-page":"74028","DOI":"10.1109\/ACCESS.2021.3080315","volume":"9","author":"DW Cheng","year":"2021","unstructured":"Cheng DW, Yao KH, Hsieh SY (2021) Constructing independent spanning trees on generalized recursive circulant graphs. IEEE Access 9:74028\u201374037","journal-title":"IEEE Access"},{"key":"4351_CR17","first-page":"126,617","volume":"413","author":"JS Yang","year":"2022","unstructured":"Yang JS, Li XY, Peng SL, Chang JM (2022) Parallel construction of multiple independent spanning trees on highly scalable datacenter networks. Appl Math Comput 413:126,617","journal-title":"Appl Math Comput"},{"issue":"3","key":"4351_CR18","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1109\/TPDS.2020.3029654","volume":"32","author":"G Chen","year":"2020","unstructured":"Chen G, Cheng B, Wang D (2020) Constructing completely independent spanning trees in data center network based on augmented cube. IEEE Trans Parallel Distrib Syst 32(3):665\u2013673","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4351_CR19","doi-asserted-by":"crossref","unstructured":"Kao SS, Klasing R, Hung LJ, Hsieh SY (2021) A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks. In: International Conference on Algorithmic Applications in Management, pp. 252\u2013264. Springer","DOI":"10.1007\/978-3-030-93176-6_22"},{"key":"4351_CR20","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.dam.2016.11.019","volume":"219","author":"B Cheng","year":"2017","unstructured":"Cheng B, Wang D, Fan J (2017) Constructing completely independent spanning trees in crossed cubes. Discret Appl Math 219:100\u2013109","journal-title":"Discret Appl Math"},{"issue":"10","key":"4351_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","journal-title":"Inf Process Lett"},{"key":"4351_CR22","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, pp. 601\u2013605. IEEE Computer Society, Washington, DC, USA. https:\/\/doi.org\/10.1109\/I-SPAN.2009.55","DOI":"10.1109\/I-SPAN.2009.55"},{"issue":"11","key":"4351_CR23","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","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4351_CR24","doi-asserted-by":"publisher","first-page":"3427","DOI":"10.1109\/ACCESS.2019.2962549","volume":"8","author":"DW Cheng","year":"2019","unstructured":"Cheng DW, Chan CT, Hsieh SY (2019) Constructing independent spanning trees on pancake networks. IEEE Access 8:3427\u20133433","journal-title":"IEEE Access"},{"issue":"147","key":"4351_CR25","first-page":"122","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(147):122\u2013147","journal-title":"IEEE Access"},{"key":"4351_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-016-1768-x","author":"B AlBdaiwi","year":"2016","unstructured":"AlBdaiwi B, Hussain Z, Cerny A, Aldred R (2016) Edge-disjoint node-independent spanning trees in dense gaussian networks. J Supercomput. https:\/\/doi.org\/10.1007\/s11227-016-1768-x","journal-title":"J Supercomput"},{"key":"4351_CR27","doi-asserted-by":"crossref","unstructured":"Hussain Z, AlBdaiwi B, AboElfotoh H (2017) Parallel construction of edge-disjoint node-independent spanning trees in dense gaussian networks. In: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA), pp. 117\u2013122. The Steering Committee of The World Congress in Computer Science, Computer","DOI":"10.1016\/j.jpdc.2017.06.018"},{"key":"4351_CR28","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"},{"issue":"8","key":"4351_CR29","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","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4351_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1134\/S0032946008010018","volume":"44","author":"C Mart\u00ednez","year":"2008","unstructured":"Mart\u00ednez C, Stafford E, Beivide R, Gabidulin EM (2008) Modeling hexagonal constellations with Eisenstein\u2013Jacobi graphs. Probl Inf Transm 44:1\u201311","journal-title":"Probl Inf Transm"},{"key":"4351_CR31","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1090\/conm\/168\/01696","volume":"168","author":"K Huber","year":"1994","unstructured":"Huber K (1994) Codes over Eisenstein\u2013Jacobi integers. Contemp Math 168:165\u2013165","journal-title":"Contemp Math"},{"issue":"1","key":"4351_CR32","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/12.46277","volume":"39","author":"MS Chen","year":"1990","unstructured":"Chen MS, Shin K, Kandlur D (1990) Addressing, routing, and broadcasting in hexagonal mesh multiprocessors. IEEE Trans Comput 39(1):10\u201318","journal-title":"IEEE Trans Comput"},{"issue":"6","key":"4351_CR33","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1109\/12.90246","volume":"40","author":"J Dolter","year":"1991","unstructured":"Dolter J, Ramanathan P, Shin K (1991) Performance analysis of virtual cut-through switching in harts: a hexagonal mesh multicomputer. IEEE Trans Comput 40(6):669\u2013680. https:\/\/doi.org\/10.1109\/12.90246","journal-title":"IEEE Trans Comput"},{"key":"4351_CR34","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.jpdc.2015.08.003","volume":"86","author":"ZA Hussain","year":"2015","unstructured":"Hussain ZA, Bose B, Al-Dhelaan A (2015) Edge disjoint Hamiltonian cycles in Eisenstein\u2013Jacobi networks. J Parallel Distrib Comput 86:62\u201370","journal-title":"J Parallel Distrib Comput"},{"key":"4351_CR35","unstructured":"Networkx: Network analysis in python. https:\/\/networkx.org\/. Accessed: 2021-01-08"},{"issue":"1","key":"4351_CR36","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/TPDS.2011.112","volume":"23","author":"B Albader","year":"2011","unstructured":"Albader B, Bose B, Flahive M (2011) Efficient communication algorithms in hexagonal mesh interconnection networks. IEEE Trans Parallel Distrib Syst 23(1):69\u201377","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"9","key":"4351_CR37","doi-asserted-by":"publisher","first-page":"2628","DOI":"10.1109\/TPDS.2015.2504936","volume":"27","author":"B Bose","year":"2015","unstructured":"Bose B, Shamaei A, Flahive M (2015) Higher dimensional gaussian networks. IEEE Trans Parallel Distrib Syst 27(9):2628\u20132638","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4351_CR38","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jpdc.2016.11.006","volume":"102","author":"Z Hussain","year":"2017","unstructured":"Hussain Z, Shamaei A (2017) Higher dimensional Eisenstein\u2013Jacobi networks. J Parallel Distrib Comput 102:91\u2013102","journal-title":"J Parallel Distrib Comput"},{"key":"4351_CR39","unstructured":"Shamaei A (2015) Interconnection networks based on gaussian and Eisenstein\u2013Jacobi integers"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04351-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04351-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04351-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T00:08:01Z","timestamp":1654819681000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04351-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,28]]},"references-count":39,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["4351"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04351-4","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,28]]},"assertion":[{"value":"31 January 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}