{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:31:14Z","timestamp":1772119874542,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T00:00:00Z","timestamp":1711670400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T00:00:00Z","timestamp":1711670400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s11227-024-06042-8","type":"journal-article","created":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T02:02:12Z","timestamp":1711677732000},"page":"15105-15121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Completely independent spanning trees in Eisenstein-Jacobi networks"],"prefix":"10.1007","volume":"80","author":[{"given":"Zaid","family":"Hussain","sequence":"first","affiliation":[]},{"given":"Fawaz","family":"AlAzemi","sequence":"additional","affiliation":[]},{"given":"Bader","family":"AlBdaiwi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,29]]},"reference":[{"key":"6042_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.tcs.2015.09.022","volume":"609","author":"X Wang","year":"2016","unstructured":"Wang X, Fan J, Jia X, Lin C-K (2016) An efficient algorithm to construct disjoint path covers of DCell networks. Theor Comput Sci 609:197\u2013210","journal-title":"Theor Comput Sci"},{"key":"6042_CR2","volume":"413","author":"J-S Yang","year":"2022","unstructured":"Yang J-S, Li X-Y, Peng S-L, Chang J-M (2022) Parallel construction of multiple independent spanning trees on highly scalable datacenter networks. Appl Math Comput 413:126617","journal-title":"Appl Math Comput"},{"key":"6042_CR3","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"},{"key":"6042_CR4","doi-asserted-by":"crossref","unstructured":"Hasunuma T (2002) Completely independent spanning trees in maximal planar graphs. In: Graph-Theoretic Concepts in Computer Science: 28th International Workshop, WG 2002 \u010cesk\u1ef3 Krumlov, Czech Republic, June 13\u201315, 2002 Revised Papers 28, Springer, pp 235\u2013245","DOI":"10.1007\/3-540-36379-3_21"},{"issue":"7","key":"6042_CR5","doi-asserted-by":"publisher","first-page":"16127","DOI":"10.3934\/math.2023823","volume":"8","author":"X Hong","year":"2023","unstructured":"Hong X, Feng W (2023) Completely independent spanning trees in some cartesian product graphs. AIMS Math 8(7):16127\u201316136","journal-title":"AIMS Math"},{"issue":"2","key":"6042_CR6","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/s00373-023-02622-2","volume":"39","author":"X Chen","year":"2023","unstructured":"Chen X, Li J, Lu F (2023) Two completely independent spanning trees of p 4-free graphs. Graphs Comb 39(2):30","journal-title":"Graphs Comb"},{"issue":"1","key":"6042_CR7","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/TPDS.2019.2931904","volume":"31","author":"X-W Qin","year":"2019","unstructured":"Qin X-W, Hao R-X, Chang J-M (2019) The existence of completely independent spanning trees for some compound graphs. IEEE Trans Parallel Distrib Syst 31(1):201\u2013210","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"6042_CR8","doi-asserted-by":"publisher","first-page":"1971","DOI":"10.1109\/TC.2022.3230288","volume":"72","author":"W Lin","year":"2023","unstructured":"Lin W, Li X-Y, Chang J-M, Jia X (2023) Constructing multiple CISTs on BCube-based data center networks in the occurrence of switch failures. IEEE Trans Comput 72:1971\u20131984. https:\/\/doi.org\/10.1109\/TC.2022.3230288","journal-title":"IEEE Trans Comput"},{"issue":"2","key":"6042_CR9","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1109\/TNSE.2022.3205706","volume":"10","author":"M Lv","year":"2022","unstructured":"Lv M, Fan J, Fan W, Jia X (2022) A high-performantal and server-centric based data center network. IEEE Trans Netw Sci Eng 10(2):592\u2013605","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"6042_CR10","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.jpdc.2022.05.010","volume":"167","author":"X-Y Li","year":"2022","unstructured":"Li X-Y, Lin W, Guo W, Chang J-M (2022) A secure data transmission scheme based on multi-protection routing in datacenter networks. J Parallel Distrib Comput 167:222\u2013231","journal-title":"J Parallel Distrib Comput"},{"key":"6042_CR11","doi-asserted-by":"publisher","first-page":"4718","DOI":"10.1007\/s11227-016-1768-x","volume":"72","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 72:4718\u20134736","journal-title":"J Supercomput"},{"key":"6042_CR12","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","DOI":"10.1016\/j.jpdc.2017.06.018"},{"key":"6042_CR13","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":"10","key":"6042_CR14","doi-asserted-by":"publisher","first-page":"12114","DOI":"10.1007\/s11227-022-04351-4","volume":"78","author":"Z Hussain","year":"2022","unstructured":"Hussain Z, AboElFotoh H, AlBdaiwi B (2022) Independent spanning trees in Eisenstein-Jacobi networks. J Supercomput 78(10):12114\u201312135","journal-title":"J Supercomput"},{"issue":"2","key":"6042_CR15","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1109\/TNSE.2022.3140329","volume":"9","author":"K-J Pai","year":"2022","unstructured":"Pai K-J, Yang J-S, Chen G-Y, Chang J-M (2022) Configuring protection routing via completely independent spanning trees in dense gaussian on-chip networks. IEEE Trans Netw Sci Eng 9(2):932\u2013946","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"6042_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3591110","volume":"55","author":"B Cheng","year":"2023","unstructured":"Cheng B, Wang D, Fan J (2023) Independent spanning trees in networks-a survey. ACM Comput Surv 55:1\u201329","journal-title":"ACM Comput Surv"},{"issue":"9","key":"6042_CR17","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1109\/TPDS.2002.1036069","volume":"13","author":"FG Nocetti","year":"2002","unstructured":"Nocetti FG, Stojmenovic I, Zhang J (2002) Addressing and routing in hexagonal networks with applications for tracking mobile users and connection rerouting in cellular networks. IEEE Trans Parallel Distrib Syst 13(9):963\u2013971","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"4","key":"6042_CR18","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/0097-8493(84)90038-4","volume":"8","author":"LN Lester","year":"1984","unstructured":"Lester LN, Sandor J (1984) Computer graphics on a hexagonal grid. Comput Graph 8(4):401\u2013409","journal-title":"Comput Graph"},{"issue":"11","key":"6042_CR19","doi-asserted-by":"publisher","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"},{"key":"6042_CR20","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-Jacobi integers. Contemp Math 168:165\u2013165","journal-title":"Contemp Math"},{"issue":"8","key":"6042_CR21","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1109\/TPDS.2009.132","volume":"21","author":"M Flahive","year":"2009","unstructured":"Flahive M, Bose B (2009) The topology of gaussian and Eisenstein-Jacobi interconnection networks. IEEE Trans Parallel Distrib Syst 21(8):1132\u20131142","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"6042_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1134\/S0032946008010018","volume":"44","author":"C Martinez","year":"2008","unstructured":"Martinez C, Stafford E, Beivide R, Gabidulin EM (2008) Modeling hexagonal constellations with Eisenstein-Jacobi graphs. Probl Inf Transm 44:1\u201311","journal-title":"Probl Inf Transm"},{"key":"6042_CR23","doi-asserted-by":"crossref","unstructured":"Hagberg AA, Schult DA, Swart PJ (2008) Exploring network structure, dynamics, and function using networkx. In: Varoquaux G, Vaught T, Millman J (eds) Proceedings of the 7th Python in Science Conference, Pasadena, CA USA, pp 11\u201315","DOI":"10.25080\/TCWV9851"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06042-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06042-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06042-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T02:05:11Z","timestamp":1731636311000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06042-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,29]]},"references-count":23,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["6042"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06042-8","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3896942\/v1","asserted-by":"object"}]},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,29]]},"assertion":[{"value":"4 March 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}