| Parallel construction of optimal independent spanning trees on hypercubes JS Yang, SM Tang, JM Chang, YL Wang Parallel Computing 33 (1), 73-79, 2007 | 93 | 2007 |
| Optimal independent spanning trees on hypercubes SM Tang, YL Wang, YH Leu J. Inf. Sci. Eng. 20 (1), 143-156, 2004 | 81 | 2004 |
| Reducing the height of independent spanning trees in chordal rings JS Yang, JM Chang, SM Tang, YL Wang IEEE Transactions on Parallel and Distributed Systems 18 (5), 644-657, 2007 | 68 | 2007 |
| Independent spanning trees on multidimensional torus networks SM Tang, JS Yang, YL Wang, JM Chang IEEE Transactions on Computers 59 (1), 93-102, 2009 | 58 | 2009 |
| On the independent spanning trees of recursive circulant graphs G (cdm, d) with d> 2 JS Yang, JM Chang, SM Tang, YL Wang Theoretical Computer Science 410 (21-23), 2001-2010, 2009 | 52 | 2009 |
| Completely independent spanning trees on complete graphs, complete bipartite graphs and complete tripartite graphs KJ Pai, SM Tang, JM Chang, JS Yang Advances in Intelligent Systems and Applications-Volume 1: Proceedings of …, 2013 | 50 | 2013 |
| Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs MM Gu, RX Hao, SM Tang, JM Chang Discrete Applied Mathematics 279, 80-91, 2020 | 42 | 2020 |
| Completely independent spanning trees on some interconnection networks KJ Pai, JS Yang, SC Yao, SM Tang, JM Chang IEICE TRANSACTIONS on information and systems 97 (9), 2514-2517, 2014 | 35 | 2014 |
| Constructing multiple independent spanning trees on recursive circulant graphs G (2m, 2) JS Yang, JM Chang, SM Tang, YL Wang International Journal of Foundations of Computer Science 21 (01), 73-90, 2010 | 30 | 2010 |
| Generalized recursive circulant graphs SM Tang, YL Wang, CY Li IEEE Transactions on Parallel and Distributed Systems 23 (1), 87-93, 2011 | 21 | 2011 |
| An efficient algorithm for solving the homogeneous set sandwich problem SM Tang, FL Yeh, YL Wang Information Processing Letters 77 (1), 17-22, 2001 | 21 | 2001 |
| Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes YH Chen, SM Tang, KJ Pai, JM Chang Theoretical Computer Science 878, 102-112, 2021 | 10 | 2021 |
| On the height of independent spanning trees of a k-connected k-regular graph SM Tang, YL Wang, JX Lee | 7 | 2001 |
| A parallel construction of vertex-disjoint spanning trees with optimal heights in star networks SS Kao, JM Chang, KJ Pai, JS Yang, SM Tang, RY Wu Combinatorial Optimization and Applications: 11th International Conference …, 2017 | 5 | 2017 |
| Parallel construction of independent spanning trees on multidimensional tori SM Tang, JS Yang, JM Chang, YL Wang Proceeding of the 24th Workshop on Combinatorial Mathematics and Computation …, 2007 | 4 | 2007 |
| Cycle embedding in generalized recursive circulant graphs SM Tang, YL Wang, CY Li, JM Chang IEICE TRANSACTIONS on Information and Systems 101 (12), 2916-2921, 2018 | 3 | 2018 |
| The tree longest detour problem in a biconnected graph FL Yeh, SM Tang, YL Wang, TY Ho European Journal of Operational Research 155 (3), 631-637, 2004 | 3 | 2004 |
| Pancyclicity on generalized recursive circulant graphs CY Li, SM Tang, YL Wang Proc. 27th Workshop Combin. Mathematics and Computation Theory, 118-123, 0 | 3 | |
| A recursive Algorithm for constructing dual-CISTs in hierarchical folded cubic networks HJ Lin, SM Tang, KJ Pai, JM Chang International Journal of Foundations of Computer Science 35 (05), 535-550, 2024 | 2 | 2024 |
| The wide diameters of regular hyper-stars and folded hyper-stars JM Chang, JS Yang, SM Tang, KJ Pai The Computer Journal 61 (1), 121-128, 2018 | 2 | 2018 |
Kung-jui Pai(白恭瑞)Department of Industrial Engineering and Management, Ming Chi University of Technology(明志科大工管)Verified email at mail.mcut.edu.tw