Amortized Efficiency of Constructing Multiple Independent Spanning Trees on Bubble-Sort Networks
Shih-Shun Kao, Kung-Jui Pai, Sun-Yuan Hsieh, Ro-Yu Wu, Jou-Ming Chang
Journal of Combinatorial Optimization, Vol. 38, No. 3, (2019) pp. 972-986.

The above article has been cited by the articles listed below.
  1. Dun-Wei Cheng, Chin-Te Chan, Sun-Yuan Hsieh, Constructing independent spanning trees on pancake networks, IEEE Access 8 (2020) 3427-3433. (*)

  2. Shuo-I Wang, Fu-Hsing Wang, Linear time algorithms for finding independent spanning trees on pyramid networks, Journal of Combinatorial Optimization39 (2020) 826-848. (*)

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

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

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

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

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

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

  9. Muhuo Liu, Guangliang Zhang, Kinkar Chandra Das, The maximum number of spanning trees of a graph with given matching number, Bulletin of the Malaysian Mathematical Sciences Society 44 (2021) 3725-3732. (*)

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

  11. Yu Qian, Baolei Cheng, Jianxi Fan, Qingrong Bian, Yifeng Wang, Yisheng Xiao, Unified method to construct node-independent spanning trees in kind of data center networks, Application Research of Computers (Chinese) 38(7) (2021).

  12. Huanwen Zhang, Yan Wang, Jianxi Fan, Ruyan Guo, Parallel construction of independent spanning trees on folded crossed cubes, Proceedings of 32nd International Conference on Application-specific Systems, Architectures and Processors (ASAP 2021), 7-9 Jul. 2021, NJ, USA, IEEE Xplore, pp. 207-210.(*)

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

  14. Fu-Hsing Wang, Shuo-I Wang, Independent spanning trees on WK-recursive networks and WK-recursive pyramids, The Journal of Supercomputing 78(7) (2022) 9879-9906. (*)

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

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

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

  18. Mengjie Lv, Jianxi Fan, Baolei Cheng, Jia Yu, Xiaohua Jia, Construction algorithms of fault-tolerant paths and disjoint paths in k-ary n-cube networks, Journal of Parallel and Distributed Computing 183 (2024) 104761. (*)

Times cited: 16 (from Web of Science)