The above article has been cited by the articles listed below.
Xie-Bin Chen,
Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs ,
Information Processing Letters 111 (2011) 235-238.
(*)
Xirong Xu, Wenhua Zhai, Jun-Ming Xu, Aihua Deng, Yuansheng Yang,
Fault-tolerant edge-pancyclicity of locally twisted cubes ,
Information Sciences 181 (2011) 2268-2277.
(*)
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.
(*)
Jong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng, László Lipták,
Independent spanning trees on even networks ,
Information Sciences 181 (2011) 2892-2905.
(*)
Ruo-Wei Hung,
Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes ,
Theoretical Computer Science 412 (2011) 4747-4753.
(*)
Yan Wang, Jianxi Fan, Guodong Zhou, Xiaohua Jia,
Independent spanning trees on twisted cubes ,
Journal of Parallel and Distributed Computing 72 (2012) 58-69.
(*)
Xiaofan Yang, Lei Wang, Luxing Yang,
Optimal broadcasting for locally twisted cubes ,
Information Processing Letters 112 (2012) 129-134.
(*)
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.
(*)
S. Femmam, JM. F. Zerarka, M. I. Benakila,
New approach construction for wireless ZigBee sensor based on embedding pancake graphs ,
Network and Communication Technologies 1 (2012) 7-25.
Yan-Hong Zhang, Wei Hao, Tao Xiang,
Independent spanning trees in crossed cubes ,
Information Processing Letters 113 (2013) 653-658.
(*)
Yuejuan Han, Jianxi Fan, Shukui Zhang
Changing the diameter of the locally twisted cube ,
International Journal of Computer Mathematics 90 (2013) 497-510.
(*)
Xie-Bin Chen,
Construction of optimal independent spanning trees on folded hypercubes ,
Information Sciences 253 (2013) 147-156.
(*)
Jinn-Shyong Yang, Jou-Ming Chang,
Optimal independent spanning trees on Cartesian product of hybrid graphs ,
The Computer Journal 57 (2014) 93-99.
(*)
Jou-Ming Chang, Kung-Jui Pai, Jinn-Shyong Yang, Hung-Chang Chan,
Embedding two disjoint multi-dimensional meshes into locally twisted cubes ,
Journal of Internet Technology 16 (2015) 541-546.
(*)
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.
(*)
Yan Wang, Jianxi Fan, Wenjun Liu, Yuejuan Han
A parallel algorithm to cnstruct BISTs on parity cubes ,
2015 2nd International Conference on Information Science and Control Engineering , Shanghai, China, 24-26 Apr. 2015, pp. 54-58.
(*)
Jou-Ming Chang, Xiang-Rui Chen, Jinn-Shyong Yang, Ro-Yu Wu,
Locally exchanged twisted cubes: connectivity and super connectivity ,
Information Processing Letters 116 (2016) 460-466.
(*)
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.
(*)
Yan Wang, Hong Shen, Jianxi Fan,
Edge-independent spanning trees in augmented cubes ,
Theoretical Computer Science 670 (2017) 23-32.
(*)
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.
(*)
Zaid Hussain, Bader AlBdaiwi, Anton Cerny,
Node-independent spanning trees in Gaussian networks ,
Journal of Parallel and Distributed Computing 109 (2017) 324-332.
(*)
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.
(*)
Smain Femmam, Faouzi M.Zerarka
One-by-one embedding of the twisted hypercube into pancake graph ,
Building Wireless Sensor Networks: Application to Routing and Data Diffusion , (2017) 145-169.
(*)
Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang,
A two-stages tree-searching algorithm for finding three completely independent spanning trees ,
Theoretical Computer Science 784 (2019) 65-74.
(*)
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.
(*)
Kung-Jui Pai,
Embedding three edge-disjoint hamiltonian cycles into locally twisted cubes ,
27th International Computing and Combinatorics Conference (COCOON 2021), Tainan, Taiwan, Oct. 24-26, 2021, Lecture Notes in Computer Science, vol 13025, pp. 367-374.
(*)
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.
Zaid Hussain, Hosam AboElFotoh, Bader AlBdaiwi,
Independent spanning trees in Eisenstein-Jacobi networks ,
The Journal of Supercomputing 78(10) (2022) 12114-12135.
(*)
Dongqin Cheng,
Embedding mutually edge-disjoint cycles into locally twisted cubes ,
Theoretical Computer Science 929 (2002) 11-17.
(*)
Selmi Aymen Takie, EddineMohamed Faouzi Zerarka, Abdelhakim Cheriet,
Dilation two embedding one-by-one particular sub-quadtree into M-dimentional crossed cubes ,
arXiv:2208.11172 [cs.DC]
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.
Baolei Cheng, Dajin Wang, Jianxi Fan,
Independent Spanning Trees in Networks - A Survey ,
ACM Computing Surveys 55(14) (2023) 335.
(*)
Dongqin Cheng,
The generalized 4-connectivity of locally twisted cubes ,
Journal of Applied Mathematics and Computing 69 (2023) 3095-3111.
(*)
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: 31 (from Web of Science)