A Fast Parallel Algorithm for Constructing Independent Spanning Trees on Parity Cubes
Yu-Huei Chang, Jinn-Shyong Yang, Jou-Ming Chang, and Yue-Li Wang
Applied Mathematics and Computation, Vol. 268, (2015) pp. 489-495.

The above article has been cited by the articles listed below.
  1. 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. (*)

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

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

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

  5. Petr Gregor, Riste Skrekovski, Vida Vukasinovic Modelling simultaneous broadcasting by level-disjoint partitions, Applied Mathematics and Computation 325 (2018) 15-23. (*)

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

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

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

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

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

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

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

  13. 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: 12 (from Web of Science)