Parallel Construction of Optimal Independent Spanning Trees on Hypercubes
Jinn-Shyong Yang, Shyue-Ming Tang, Jou-Ming Chang, and Yue-Li Wang
Parallel Computing, Vol. 33, No. 1, (2007) pp. 73-79.

The above article has been cited by the articles listed below.
  1. Sun-Yuan Hsieh, Chang-Jen Tu, Constructing edge-disjoint spanning trees in locally twisted cubes, Theoretical Computer Science 410 (2009) 926-932. (*)

  2. Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang, On the independent spanning trees of recursive circulant graphs G(cd^m, d) with d > 2, Theoretical Computer Science 410 (2009) 2001-2010. (*)

  3. Shyue-Ming Tang, Jinn-Shyong Yang, Yue-Li Wang, Jou-Ming Chang, Independent Spanning Trees on Multidimensional Torus Networks, IEEE Transactions on Computers 59 (2010) 93-102. (*)

  4. Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang, Constructing multiple independent spanning trees on recursive circulant graphs G(2^m,2), International Journal of Foundations of Computer Science 21 (2010) 73-90. (*)

  5. Yi-Jiun Liu, Well Y. Chou, James K. Lan, Chiuyuan Chen, Constructing independent spanning trees for hypercubes and locally twisted cubes, Proceedings of the 10th International Symposium on Pervasive Systems, Algorithms, and Networks (ISPAN 2009), Kaoshiung, Taiwan, Dec. 14-16, 2009, pp. 17-22. (*)

  6. Jinn-Shyong Yang, Jou-Ming Chang, Hung-Chang Chan, Independent spanning trees on folded hypercubess, Proceedings of the 10th International Symposium on Pervasive Systems, Algorithms, and Networks (ISPAN 2009), Kaoshiung, Taiwan, Dec. 14-16, 2009, pp. 601-605.> (*)

  7. Jia-Cian Lin, Jinn-Shyong Yang, Chiun-Chieh Hsu, Jou-Ming Chang, Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes, Information Processing Letters 109 (2009) 1197-1201. (*)

  8. Ming-Chien Yang, Constructing edge-disjoint spanning trees in twisted cubes, Information Sciences 180 (2010) 4075-4083. (*)

  9. Jinn-Shyong Yang, Jou-Ming Chang, Independent spanning trees on folded hyper-Stars, Networks 56 (2010) 272-281. (*)

  10. Xie-Bin Chen, Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs, Information Processing Letters 111 (2011) 235-238. (*)

  11. Jong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng, László Lipták, Optimal independent spanning trees on odd graphs, The Journal of Supercomputing 56 (2011) 212-225. (*)

  12. Yi-Jiun Liu, James K. Lan, Well Y. Chou, Chiuyuan Chen, Constructing independent spanning trees for locally twisted cubes, Theoretical Computer Science 412 (2011) 2237-2252. (*)

  13. Jinn-Shyong Yang, Hung-Chang Chan, Jou-Ming Chang, Broadcasting secure messages via optimal independent spanning trees in folded hypercubes, Discrete Applied Mathematics 159 (2011) 1254-1263. (*)

  14. Jong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng, László Lipták, Independent spanning trees on even networks, Information Sciences 181 (2011) 2892-2905. (*)

  15. Cheng-Nan Lai, An optimal construction of node-disjoint shortest paths in hypercubes, Proceedings of the 28th Workshop on Combinatorial Mathematics and Computation Theory, Penghu,, Taiwan, May 27-28, 2011, pp. 245-253.

  16. R. K. Dash, C.R. Tripathy, Comparative analysis on reliability of hypercube and torus topologies under link failure model, International Journal of Advancements in Computer Science and Information Technology 1 (2011) 1-9.

  17. Chuanxiong Guo, Guohan Lu, Yongqiang Xiong, Jiaxin Cao, Yibo Zhu, Chen Chen, Yongguang Zhang, Datacast: a scalable and efficient group data delivery service for data centers, Report MSR-TR-2011-76 from Microsoft Research Asia (2011).

  18. Yan Wang, Jianxi Fan, Guodong Zhou, Xiaohua Jia, Independent spanning trees on twisted cubes, Journal of Parallel and Distributed Computing 72 (2012) 58-69. (*)

  19. Toru Hasunuma, Chie Morisaka, Completely independent spanning trees in torus networks, Networks 60 (2012) 59-69. (*)

  20. Jeeraporn Werapun, Sarun Intakosum, Veera Boonjing, An efficient parallel construction of optimal independent spanning trees on hypercubes, Journal of Parallel and Distributed Computing 72 (2012) 1713-1724. (*)

  21. Baolei Cheng, Jianxi Fan, Xiaohua Jia, Jin Wang, Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes, Journal of Parallel and Distributed Computing 73 (2013) 641-652. (*)

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

  23. Yan-Hong Zhang, Wei Hao, Tao Xiang, Independent spanning trees in crossed cubes, Information Processing Letters 113 (2013) 653-658. (*)

  24. Baolei Cheng, Jianxi Fan, Xiaohua Jia, Juncheng Jia, Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes, Journal of Supercomputing 65 (2013) 1279-1301. (*)

  25. Baolei Cheng, Jianxi Fan, Xiaohua Jia, Shukui Zhang, Bangrui Chen, Constructive algorithm of independent spanning trees on Möbius cubes, The Computer Journal 56 (2013) 1347-1362. (*)

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

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

  28. Baolei Cheng, Jianxi Fan, Jiwen Yang, Xi Wang, Circular dimensional-permutations and reliable broadcasting for hypercubes and Möbius Cubes, 10th IFIP International Conference on Network and Parallel Computing (NPC 2013), Lecture Notes in Computer Science Volume 8147, 2013, pp 232-244. (*)

  29. Wan Tang, Ximin Yang, Jingcong Li, Zilong Ye, Dynamical Multicast Light-Tree Construction in Intra-Datacenter Networks with Fast Optical Switching, Journal of Internet Technology 15 (2014) 679-684. (*)

  30. Alexandre Salles da Cunha, Fernanda Sumika Hojo de Souza, Finding totally independent spanning trees with linear integer programming, Third International Symposium on Combinatorial Optimization, (ISCO 2014) Lisbon, Portugal, March 5-7, 2014, Lecture Notes in Computer Science Vol. 8596, pp. 149-160.

  31. Eduardo Sant'Ana da Silvá, Andre Luiz Pires Guedes, Eduardo Todt, Independent spanning trees on systems-on-chip hypercubes routing, International Scholarly and Scientific Research and Innovation 7(3) (2013) 494-497.

  32. Lokendra Singh Umrao, Dharmendra Prasad Mahato, Ravi Shankar Singh Fault tolerance for hypercube networks via independent spanning trees, Proceedings of the 3rd International Conference on Parallel, Distributed and Grid Computing (PDGC-2014), Himachal Pradesh, India, Dec. 11-13, 2014, pp. 191-195. (*)

  33. 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. (*)

  34. Baolei Cheng, Jianxi Fan, Dajin Wang, Jiwen Yang, A reliable broadcasting algorithm in locally twisted cubes, Proceedings of the 2nd IEEE International Conference on Cyber Security and Cloud Computing (CSCloud 2015), New York; United States, Nov. 3-5, 2015, pp. 323-328. (*)

  35. Baolei Cheng, Jianxi Fan, Xiaohua Jia, Dimensional-permutation-based independent spanning trees in bijective connection networks, IEEE Transactions on Parallel and Distributed Systems 26 (2015) 45-53. (*)

  36. 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. (*)

  37. 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. (*)

  38. 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. (*)

  39. 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. (*)

  40. Toru Hasunuma, Structural properties of subdivided-line graphs, Journal of Discrete Algorithms 31 (2015) 69-86. (*)

  41. Eduardo Sant'Ana da Silva, Helio Pedrini, Inferring patterns in mitochondrial DNA sequences through hypercube independent spanning trees, Computers in Biology and Medicine 70 (2016) 51-57. (*)

  42. Xiaoqiang Chen, Jianxi Fan, Cheng-Kuan Lin, Baolei Cheng, Zhao Liu, A VoD system model based on BC graphs, Proceedings of the 4th National Conference on Electrical, Electronics and Computer Engineering (NCEECE 2015), Xian, China, Dec. 12-13, 2015, pp. 1499-1505. (*)

  43. Baolei Cheng, Jianxi Fan, Dajin Wang, Jiwen Yang, A reliable broadcasting algorithm in locally twisted cubes, Proceedings of the 2nd IEEE International Conference on Cyber Security and Cloud Computing (CSCloud 2015), New York; United States, Nov. 3-5, 2015, pp. 323-328.

  44. Eduardo Sant'Ana da Silva, Helio Pedrini, Connected-component labeling based on hypercubes for memory constrained scenarios, Expert System with Applications 61 (2016) 272-281. (*)

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

  46. 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. (*)

  47. 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. (*)

  48. Yuan-Hsun Lo, Yijin Zhang, Yi Chen, Hung-Lin Fu, Wing Shing Wong, The global packing number of a fat-tree network, IEEE Transactions on Information Theory 63 (2017) 5327-5335. (*)

  49. Benoit Darties, Nicolas Gastineau, Olivier Togni, Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees, Discrete Applied Mathematics 236 (2018) 124-136. (*)

  50. Souvik Roy, Arunima Ray, Sukanta Das, A cellular automaton that solves distributed spanning tree problem, Journal of Computational Science 26 (2018) 39-54. (*)

  51. Smruti A. Mane, Smita A. Kandekar, Balu N. Waphare, Constructing spanning trees in augmented cubes, Journal of Parallel and Distributed Computing 122 (2018) 188-194. (*)

  52. Baolei Cheng, Jianxi Fan, Xiaoyan Li, Guijuan Wang, Jingya Zhou, Yuejuan Han, Towards the independent spanning trees in the line graphs of interconnection networks, International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP 2018), Guangzhou, China, Nov. 15-17, 2018, Lecture Notes in Computer Science Vol. 10743, pp. 1-14.(*)

  53. Klaus-Tycho Foerster, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Tredan, CASA: congestion and stretch aware static fast rerouting, IEEE INFOCOM 2019, Paris, France, Apr. 2019, art. no. 8737438, pp. 469-477. (*)

  54. Baolei Cheng, Jianxi Fan, Cheng-Kuan Lin, Xiaohua Jia, Xiaoyan Li, Constructing node-independent spanning trees on the line graph of the hypercube by an independent forest scheme, Journal of Parallel and Distributed Computing 134 (2019) 104-115. (*)

  55. 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. (*)

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

  57. 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. (*)

  58. 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.(*)

  59. 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. (*)

  60. 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. (*)

  61. 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. (*)

  62. Ningning Liu, Yujie Zhang, Weibei Fan Construction of completely independent spanning tree based on vertex degree, Proceedings of International Conference on Parallel and Distributed Computing: Applications and Technologies (IPDCAT 2020), Shenzhen, China, Dec. 28-30, 2020, Lecture Notes in Computer Science, Vol 12606. Springer, Cham. pp. 94-103

  63. 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. (*)

  64. 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.

  65. 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. (*)

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

  67. 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. (*)

Times cited: 58 (from Web of Science)