Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link |
2001 | A family of optimal 1-Hamiltonian graphs with diameter O(log n) | Wang, Jeng-Jung; Sung, Ting-Yi; Hsu, Lih-Hsing | Journal of Information Science and Engineering 17 | | | |
2005 | A note on edge fault tolerance with respect to hypercubes | Ho, Tung-Yang; Sung, Ting-Yi; Hsu, Lih-Hsing | Applied Mathematics Letters 18 | | | |
1996 | A response to Volgenant\'s addendum on the most vital edges | Hung, Chun-nan; Hsu, Lih-Hsing; Sung, Ting-Yi | Networks 27 | | | |
1999 | Christmas tree: a versatile 1-fault-tolerant design for token rings | Hung, Chun-Nan; Hsu, Lih-Hsing; Sung, Ting-Yi | Information Processing Letters 72 | | | |
2000 | Construction schemes for fault tolerant Hamiltonian graphs | Wang, Jeng-Jung; Hung, Chun-Nan; Tan, Jimmy J. M.; Hsu, Lih-Hsing; Sung, Ting-Yi | Networks 35 | | | |
2000 | Edge congestion and topological properties of crossed cubes | Chang, Chien-Ping; Sung, Ting-Yi; Hsu, Lih-Hsing | IEEE Transactions on Parallel and Distributed Systems 11 | | | |
1997 | Extended tree contraction for some parallel algorithms on series-parallel networks | Wang, Jenn-Jung; Wang, Shih-Yih; Hsu, Lih-Hsing; Sung, Ting-Yi | Journal of Information Science and Engineering 13, 665-680 | | | |
1997 | Faithful 1-edge fault tolerant graphs | Hsu, Lih-Hsing; Wang, Shih-Yih; Sung, Ting-Yi | Information Processing Letters 61 | | | |
1998 | Fault-tolerant token ring embedding in double loop networks | Sung, Ting-Yi; Lin, Chun-Yuan; Chuang, Yen-Chu; Hsu, Lih-Hsing | Information Processing Letters 66 | | | |
1994 | Finding the most vital edges with respect to the number of spanning trees | Tsen, Fu-Shang P.; Sung, Ting-Yi; Lin, Men-Yang; Hsu, Lih-Hsing | IEEE Trans. on Reliability 43 | | | |
2001 | On the construction of combined k-fault-tolerant hamiltonian graphs | Hung, Chun-Nan; Hsu, Lih-Hsing; Sung, Ting-Yi | Networks 37 | | | |
2000 | On the isomorphism between cyclic-cubes and wrapped butterfly network | Hung, Chun-Nan; Wang, Jeng-Jung; Sung, Ting-Yi; Hsu, Lih-Hsing | IEEE Transactions on Parallel and Distributed Systems 11 | | | |
2000 | Optimal k-fault-tolerant networks for token rings | Sung, Ting-Yi; Ho, Tung-Yang; Chang, Chien-Ping; Hsu, Lih-Hsing | Journal of Information Science and Engineering 16, 381--390 | | | |
2000 | Optimum congested routing strategy on twisted cubes | Li, Tseng-Kuei; Tan, Jimmy J. M.; Sung, Ting-Yi; Hsu, Lih-Hsing | Journal of Interconnection Networks 1 | | | |
1993 | The most vital edges of matching in bipartite graphs | Hung, Chun-Nan; Hsu, Lih-Hsing; Sung, Ting-Yi | Networks 35 | | | |
1998 | The recognition of double euler trails in series-parallel networks | Ho, Tung-Yang; Sung, Ting-Yi; Hsu, Lih-Hsing; Tsai, Chang-Hsiung; Hwang, Jeng-Yan | Algorithms 28 | | | |
2001 | The shuffle-cubes and their generalization | Li, Tseng-Kuei; Tan, Jimmy J. M.; Hsu, Lih-Hsing; Sung, Ting-Yi | Information Processing Letters 77 | | | |
1996 | Transmitting on various network topologies | Ho, Tung-Yang; Hsu, Lih-Hsing; Sung, Ting-Yi | Networks 27 | | | |