Independent Spanning Trees on Multidimensional Torus Networks
Shyue-Ming Tang, Jinn-Shyong Yang, Yue-Li Wang, and Jou-Ming Chang
IEEE Transactions on Computers, Vol. 59, No. 1, (2010) pp. 93-102.
The above article has been cited by the articles listed below.
Sun-Yuan Hsieh, Chang-Jen Tu,
Constructing edge-disjoint spanning trees in locally twisted cubes
,
Theoretical Computer Science
410 (2009) 926-932.
Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang,
Constructing multiple independent spanning trees on recursive circulant graphs
,
International Journal of Foundations of Computer Science
21 (2010) 73-90.
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.
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.
(*)
Ming-Chien Yang,
Constructing edge-disjoint spanning trees in twisted cubes
,
Information Sciences
180 (2010) 4075-4083.
(*)
Jinn-Shyong Yang, Jou-Ming Chang,
Independent spanning trees on folded hyper-Stars
,
Networks
56 (2010) 272-281.
(*)
Xie-Bin Chen,
Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
,
Information Processing Letters
111 (2011) 235-238.
(*)
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,
Optimal independent spanning trees on odd graphs
,
The Journal of Supercomputing
56 (2011) 212-225.
Jong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng, László Lipták,
Independent spanning trees on even networks
,
Information Sciences
181 (2011) 2892-2905.
(*)
Toru Hasunuma, Chie Morisaka,
Completely independent spanning trees in torus networks
,
Networks
60 (2012) 59-69.
(*)
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.
(*)
Jiaxin Cao, Chuanxiong Guo, Guohan Lu, Yongqiang Xiong, Yixin Zhang, Yongguang Zhang, Yibo Zhu, Chen Chen, Ye Tian,
Datacast: a scalable and efficient group data delivery service for data centers
,
IEEE Journal on Selected Areas in Communications
31 (2013) 2632-2645.
Baolei Cheng, Jianxi Fan, Xiaohua Jia, Shukui Zhang,
Independent spanning trees in crossed cubes
,
Information Sciences
233 (2013) 276-289.
(*)
Yan-Hong Zhang, Wei Hao, Tao Xiang,
Independent spanning trees in crossed cubes
,
Information Processing Letters
113 (2013) 653-658.
(*)
Shyue-Ming Tang,
Construct independent spanning trees on chordal rings with multiple chords
,
Smart Innovation, Systems and Technologies
20 (2013) 481-490.
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.
(*)
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.
(*)
Hee-Chul Kim, Hyeong-Seok Lim, Jung-Heum Park
An approach to conditional diagnosability analysis under the PMC model and its application to torus networks
,
Theoretical Computer Science
548 (2012) 98-116.
(*)
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 & Innovation
7(3) (2013) 494-497.
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.
(*)
Xie-Bin Chen,
Panconnectivity and edge-pancyclicity of multidimensional torus networks
,
Discrete Applied Mathematics
178 (2014) 33-45.
(*)
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.
(*)
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 Supercomputing
71 (2015) 894-908.
(*)
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.
(*)
Toru Hasunuma,
Minimum degree conditions and optimal graphs for completely independent sanning trees
,
Proceedings of the 26th International Workshop on Combinatorial Algorithms (IWOCA 2015),
KVerona, Italy, Oct. 5-7, 2015, pp. 260-273
Toru Hasunuma,
Structural properties of subdivided-line graphs
,
Journal of Discrete Algorithms
31 (2015) 69-86.
(*)
Yukihiro Hamada,
Independent spanning trees of 2-chordal rings
,
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
E99-A (2016) 355-362.
(*)
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.
(*)
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.
(*)
Shuo-I Wang, Fu-Hsing Wang,
Independent Spanning Trees in RTCC-Pyramids
,
The Computer Journal
60 (2017) 13-26.
(*)
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.
(*)
Bao-lei Cheng, Ting Pan, Jian-xi Fan, Jing-ya Zhou, Zhao Liu,
A secure message transmission scheme in an extended network of crossed cubes
, Proceedings of International Conference on Computer Networks and Communication Technology (CNCT 2016),
Advances in Computer Science Research
54 (2017) 757-764.
(*)
Zaid Hussain, Bader AlBdaiwi, Anton Cerny,
Node-independent spanning trees in Gaussian networks
,
Journal of Parallel and Distributed Computing
109 (2017) 324-332.
(*)
Baolei Cheng, Jianxi Fan, Qiang Lyu, Jingya Zhou, Zhao Liu,
Constructing independent spanning trees with height n on the n-dimensional crossed cube
,
Future Generation Computer Systems
87 (2018) 404-415.
(*)
Shuo-I Wang, Fu-Hsing Wang,
Linear time algorithms for finding independent spanning trees on pyramid networks
,
Journal of Combinatorial Optimization
39 (2020) 826-848.
(*)
Baolei Cheng, Jianxi Fan, Cheng-Kuan Lin, Yan Wang, Guijuan Wang,
An improved algorithm to construct edge-independent spanning trees in augmented cubes
,
Discrete Applied Mathematics
277 (2020) 55-70.
(*)
Baolei Cheng, Jianxi Fan, Qiang Lyu, Cheng-Kuan Lin, Xiaoyan Li, Gul Chen,
Constructing node-independent spanning trees in augmented cubes
,
Fundamenta Informaticae
176 (2020) 103-128.
(*)
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.
(*)
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
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.
(*)
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.
(*)
Baolei Cheng, Dajin Wang, Jianxi Fan,
Independent Spanning Trees in Networks - A Survey
,
ACM Computing Surveys
55(14) (2023) 335.
(*)
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.
(*)
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:
37
(from Web of Science)