Broadcasting Secure Messages via Optimal Independent Spanning Trees in Folded Hypercubes
Jinn-Shyong Yang, Hung-Chang Chan, and Jou-Ming Chang
Discrete Applied Mathematics, Vol. 159, No. 12, (2011) pp. 1254-1263.

The above article has been cited by the articles listed below.
  1. Yan Wang, Jianxi Fan, Xiaohua Jia, He Huang, An algorithm to construct independent spanning trees on parity cubes, Theoretical Computer Science 465 (2012) 61-72. (*)

  2. Shyue-Ming Tang, Construct independent spanning trees on chordal rings with multiple chords, Smart Innovation, Systems and Technologies 20 (2013) 481-490.

  3. Xie-Bin Chen, Construction of optimal independent spanning trees on folded hypercubes, Information Sciences 253 (2013) 147-156. (*)

  4. Lokendra Singh Umrao, Dharmendra Prasad Mahato, Ravi Shankar Singh, Fault tolerance for hypercube networks via independent spanning trees, Proceedings of IEEE International Conference Parallel Distributed Grid Computing (PDGC 2014), Waknaghat solan, India, Dec. 11-13, 2014, pp. 191-195. (*)

  5. Yu-Huei Chang, Jinn-Shyong Yang, Jou-Ming Chang, Yue-Li Wang, Parallel construction of independent spanning trees on parity cubes, Proceedings of IEEE 17th International Conference on Computational Science and Engineering (CSE 2014), Chengdu, China, Dec. 19-21, 2014, pp. 1150-1154. (*)

  6. Jinn-Shyong Yang, Jou-Ming Chang, Optimal independent spanning trees on Cartesian product of hybrid graphs, The Computer Journal 57 (2014) 93-99. (*)

  7. Che-Nan Kuo, Chia-Wei Lee, Nai-Wen Chang, Kuang-Husn Shih Extended fault-tolerant bipanconnectivity and panconnectivity of folded hypercubes, International Journal of Mobile Communications 12 (2014) 397-410. (*)

  8. Jou-Ming Chang, Jhen-Ding Wang, Jinn-Shyong Yang, Kung-Jui Pai, A comment on "Independent spanning trees in crossed cubes", Information Processing Letters 114 (2014) 734-739. (*)

  9. Cheng-Nan Lai, An efficient construction of one-to-many node-disjoint paths in folded hypercubes, Journal of Parallel and Distributed Computing 74 (2014) 2310-2316.

  10. Jinn-Shyong Yang, Meng-Ru Wu, Jou-Ming Chang, Yu-Huei Chang, A fully parallelized scheme of constructing independent spanning trees on Möbius cubes, Journal of Supercomputing71 (2015) 894-908. (*)

  11. Yu-Huei Chang, Jinn-Shyong Yang, Jou-Ming Chang, Yue-Li Wang, A fast parallel algorithm for constructing independent spanning trees on parity cubes, Applied Mathematics and Computation 268 (2015) 489-495. (*)

  12. Jinn-Shyong Yang, Jou-Ming Chang, Kung-Jui Pai, Hung-Chang Chan, Parallel construction of independent spanning trees on enhanced hypercubes, IEEE Transactions on Parallel and Distributed Systems 26 (2015) 3090-3098. (*)

  13. Jinn-Shyong Yang, Sih-Syuan Luo, Jou-Ming Chang, Pruning longer branches of independent spanning trees on folded hyper-stars, The Computer Journal 58 (2015) 2972-2981. (*)

  14. Yan Wang, Jianxi Fan, Wenjun Liu, Yuejuan Han A parallel algorithm to construct BISTs on parity cubes, 2015 2nd International Conference on Information Science and Control Engineering, Shanghai, China, 24-26 Apr. 2015, pp. 54-58. (*)

  15. Bader AlBdaiwi, Zaid Hussain, Anton Cerny, Robert Aldred, Edge-disjoint node-independent spanning trees in dense Gaussian networks, Journal of Supercomputing 72 (2016) 4718-4736. (*)

  16. Yan Wang, Hong Shen, Jianxi Fan, Edge-independent spanning trees in augmented cubes, Theoretical Computer Science 670 (2017) 23-32. (*)

  17. Jou-Ming Chang, Ting-Jyun Yang, Jinn-Shyong Yang, A parallel algorithm for constructing independent spanning trees in twisted cubes, Discrete Applied Mathematics 219 (2017) 74-82. (*)

  18. Yu-Huei Chang, Jinn-Shyong Yang, Sun-Yuan Hsieh, Jou-Ming Chang, Yue-Li Wang, Construction independent spanning trees on locally twisted cubes in parallel, Journal of Combinatorial Optimization 33 (2017) 956-967. (*)

  19. Zaid Hussain, Bader AlBdaiwi, Anton Cerny, Node-independent spanning trees in Gaussian networks, Journal of Parallel and Distributed Computing 109 (2017) 324-332. (*)

  20. Shih-Shun Kao, Jou-Ming Chang, Kung-Jui Pai, Jinn-Shyong Yang, Shyue-Ming Tang, Ro-Yu Wu, A parallel construction of vertex-disjoint spanning trees with optimal heights in star networks, 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2017), Shanghai, China, Dec. 16-18, 2018, Lecture Notes in Computer Science, vol. 10627, Part I, pp. 41-55. (*)

  21. Bui Thi Thuan, Lam Boi Ngoc, Keiichi Kaneko, A stochastic link-fault-tolerant routing algorithm in folded hypercubes, Journal of Supercomputing 74 (2018) 5539-5557. (*)

  22. Shih-Shun Kao, Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu, Constructing independent spanning trees on Bbubble-sort networks, 24th International Computing and Combinatorics Conference (COCOON 2018), Qingdao, China, July 2¡V4, 2018, Lecture Notes in Computer Science, vol. 10976, pp. 1-13. (*)

  23. Shih-Shun Kao, Kung-Jui Pai, Sun-Yuan Hsieh, Ro-Yu Wu, Jou-Ming Chang, Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks, Journal of Combinatorial Optimization 38 (2019) 972-986. (*)

  24. Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang, A protection routing with secure mechanism in Mobius cubess, Journal of Parallel and Distributed Computing 140 (2020) 1-12. (*)

  25. Jie-Fu Huang, Shih-Shun Kao, Sun-Yuan Hsieh, Ralf Klasing, Top-down construction of independent spanning trees in alternating group networks, IEEE Access 8 (2020) 112333-112347. (*)

  26. Chien-Fu Lin, Jie-Fu Huang, Sun-Yuan Hsieh, Constructing independent spanning trees on transposition networks, IEEE Access 8 (2020) 147122-147132. (*)

  27. Jie-Fu Huang, Sun-Yuan Hsieh, Recursive and parallel constructions of independent spanning trees in alternating group networks, International Journal of Computer Mathematics: Computer Systems Theory 5 (2020) 234-262.(*)

  28. Jie-Fu Huang, Sun-Yuan Hsieh, Constructing independent spanning trees in alternating group networks, Proceedings of 26th International Conference on Computing and Combinatorics (COCOON 2020), 29-31 Aug. 2020, Atlanta, GA, USA, LNCS 12273, pp. 198-209.(*)

  29. Jie-Fu Huang, Eddie Cheng, Sun-Yuan Hsieh, Two algorithms for constructing independent spanning trees in (n,k)-star graphs, IEEE Access 8 (2020) 175932-175947. (*)

  30. Yu-Huei Chang, Kung-Jui Pai, Chiun-Chieh Hsu, Jinn-Shyong Yang, Jou-Ming Chang, Constructing dual-CISTs of folded divide-and-swap cubes, Theoretical Computer Science 856 (2021) 75-87. (*)

  31. Jie-Fu Huang, Sun-Yuan Hsieh, Two methods for constructing independent spanning trees in alternating group network, Proceedings Companion of the 2020 IEEE 20th International Conference on Software Quality, Reliability, and Security, (QRS-C 2020), 11-14 Dec. 2020, Macau, China, pp. 616-621. (*)

  32. Yi-Cheng Yang, Shin-Shun Kao, Ralf Klasing, Sun-Yuan Hsieh, Hsin-Hung Chou, Jou-Ming Chang, The construction of multiple independent spanning trees on burnt pancake networks, IEEE Access 9 (2021) 16679-16691. (*)

  33. Saber Gholami, Hovhannes A. Harutyunyan, A Broadcasting heuristic for hypercube of trees, Proceedings of 2021 IEEE 11th Annual Computing and Communication Workshop and Conference (CCWC 2021), 27-30 Jan. 2021, NV, USA, art. no. 9375923, pp. 355-361. (*)

  34. Dun-Wei Cheng, Kai-Hsun Yao, Sun-Yuan Hsieh, Construction independent spanning trees on generalized recursive circulant graphs, IEEE Access 9 (2021) 74028-74037. (*)

  35. Jinn-Shyong Yang, Xiao-Yan Li, Sheng-Lung Peng, Jou-Ming Chang, Parallel construction of multiple independent spanning trees on highly scalable datacenter network, Applied Mathematics and Computation 413 (2022) 126617. (*)

  36. Xiao-Wen Qin, Rong-Xia Hao, Jie Wu Construction of dual-CISTs on an infinite class of networks, IEEE Transactions on Parallel and Distributed Systems 33(8) (2022) 1902-1910. (*)

  37. Shin-Shun Kao, Ralf Klasing, Ling-Ju Hung, Sun-Yuan Hsieh, A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks, Proceedings of 15th International Conference on Algorithmic Aspects in Information and Management (AAIM 2021), LNCS 13153, pp. 252-264, 2021.

  38. Kung-Jui Pai, Jinn-Shyong Yang, Guan-Yu Chen, Jou-Ming Chang, Configuring protection routing via completely independent spanning trees in dense Gaussian on-chip networks, IEEE Transactions on Network Science and Engineering 9(2) (2022) 932-946. (*)

  39. Zaid Hussain, Hosam AboElFotoh, Bader AlBdaiwi, Independent spanning trees in Eisenstein-Jacobi networks, The Journal of Supercomputing 78(10) (2022) 12114-12135. (*)

  40. Kung-Jui Pai, Ro-Yu Wu, Sheng-Lung Peng, Jou-Ming Chang, Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting, The Journal of Supercomputing 79(4) (2023) 4126-4145. (*)

  41. Zhiyong Pan, Baolei Cheng, Jianxi Fan, Yan Wang, Xiajing Li, A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks, Theoretical Computer Science 942 (2023) 33-46. (*)

  42. Baolei Cheng, Dajin Wang, Jianxi Fan, Independent Spanning Trees in Networks - A Survey, ACM Computing Surveys 55(14) (2023) 335. (*)

  43. Shih-Shun Kao, Ralf Klasing, Ling-Ju Hung, Chia-Wei Lee, Sun-Yuan Hsieh, A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks, Journal of Parallel and Distributed Computing 181 (2023) 104731. (*)

  44. Huanwen Zhang,Yan Wang, Jianxi Fan, Chang Shu, Edge-independent spanning trees in folded crossed cubes, Theoretical Computer Science 970 (2023) 114053. (*)

  45. Huanwen Zhang, Yan Wang, Jianxi Fan, Yuejuan Han, Baolei Cheng, Constructing edge-disjoint spanning trees in several cube-based networks with applications to edge fault-tolerant communication, The Journal of Supercomputing 80(2) (2024) 1907-1934. (*)

  46. Qi He, Yan Wang, Jianxi Fan, Baolei Cheng, Parallel construction of edge-independent spanning trees in complete Josephus cubes, The Journal of Supercomputing 81(1) (2025) 334.

Times cited: 42 (from Web of Science)