Abstract
The use of independent spanning trees (ISTs) has scientific applications in fault-tolerant requirement in network protocols and secure message distributions. Most of the designs of ISTs are for those interconnection networks with vertex symmetric property, implying that one can find ISTs rooted on a designated vertex, and, by the vertex symmetry property of the given network, hence have solved the ISTs problem on any arbitrary vertex. The existence of asymmetry makes the ISTs problem even harder than its symmetric counterpart. In this paper, we propose two linear time algorithms that solved ISTs rooted at an arbitrary vertex of WK-recursive networks and WK-recursive pyramids separately. The performance of the proposed algorithms is evaluated both, analytically and experimentally, in terms of tree heights and average distances.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bao F, Funyu Y, Hamada Y, Igarashi Y (1997) Reliable broadcasting and secure distributing in channel networks. In: ISPAN, p 472
Cheng B, Fan J, Jia X, Zhang S, Chen B (2013) Constructive algorithm of independent spanning trees on Möbius cubes. Comput J 56:1347–1362
Chang JM, Wang JD, Yang JS, Pai KJ (2014) A comment on independent spanning trees in crossed cubes. Inf Process Lett 114:734–739
Cheng DW, Chan CT, Hsieh SY (2020) Constructing independent spanning trees on pancake networks. IEEE Access 8:3427–3433
Cheriyan J, Maheshwari SN (1988) Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. J Algorithms 9:507–537
Della Vecchia G, Sanges C (1988) A recursively scalable network VLSI implementation. Future Gener Comput Syst 4(3):235–243
Fu JS (2005) Hamiltonicity of the WK-Recursive network with and without faulty vertices. IEEE Trans Parallel Distrib Syst 16(9):853–865
Farahabady MH, Sarbazi-Azad H (2005) The WK-recursive pyramid: an efficient network topology. In: Proceedings of the 8th International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN’05), pp 312–317
Huang JF, Cheng E, Hsieh SY (2020) Two algorithms for constructing independent spanning trees in (n, k)-star graphs. IEEE Access 8:175932–175947
Hussain Z, AlBdaiwi B, Cerny A (2017) Node-independent spanning trees in Gaussian networks. J Parallel Distrib Comput 109:324–332
INMOS Limited (1988) Transputer reference manual. Prentice-Hall, Upper Saddle River, NJ
Kao SS, Pai KJ, Hsieh SY, Wu RY, Chang JM (2019) Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks. J Comb Optim 38:972–986
Lin CF, Huang JF, Hsieh SY (2020) Constructing independent spanning trees on transposition networks. IEEE Access 8:147122–147132
Suboh S, Bakhouya M, Gaber J, El-Ghazawi T (2008) An interconnection architecture for network-onchip systems. Telecommun Syst 37(1):137–144
Tang SM, Wang YL, Leu YH (2004) Optimal independent spanning trees on hypercubes. J Inf Sci Eng 20(1):143–155
Wang Y, Fan J, Jia X, Huang H (2012) An algorithm to construct independent spanning trees on parity cubes. Theor Comput Sci 465:61–72
Wang SI, Wang FH (2017) Independent spanning trees in RTCC-pyramids. Comput J 60:13–26
Wang SI, Wang FH (2020) Linear time algorithms for finding independent spanning trees on pyramid networks. J Comb Optim 39:826–848
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Wang, FH., Wang, SI. Independent spanning trees on WK-recursive networks and WK-recursive pyramids. J Supercomput 78, 9879–9906 (2022). https://doi.org/10.1007/s11227-021-04296-0
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-021-04296-0