公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 |
2005 | Midterm Exam. (Special topics on graph algorithms) | Chao, Kun-Mao | | | | |
2004 | Midterm Exam. (Special topics on graph algorithms) | Chao, Kun-Mao | | | | |
2005 | Minimum Routing Cost Spanning Trees | Chao, Kun-Mao; 趙坤茂 | | | | |
- | Minimum Spanning Trees | Chao, Kun-Mao; 趙坤茂 | | | | |
- | Minimum Spanning Trees | Wu, Bang-Ye; Chao, Kun-Mao | | | | |
2004 | a note on 15/8 & 3/2-approximation algorithms for the MRCT problem | Wu, Bang-Ye; Chao, Kun-Mao | | | | |
2004 | A note on a 2-approximation algorithm for the mrct problem | Wu, Bang-Ye; Chao, Kun-Mao | | | | |
2004 | A note on a polynomial time approximation scheme for the mrct problem | Wu, Bang-Ye; Chao, Kun-Mao | | | | |
2004 | A note on eccentricities, diameters, and radii | Wu, Bang-Ye; Chao, Kun-Mao | | | | |
2004 | A note on optimal communication spanning trees | Wu, Bang-Ye; Chao, Kun-Mao | | | | |
2006 | A note on the uniform edge-partition of a tree | Wu, Bang-Ye; Wang, Hung-Lung; Kuan, Shih-Ta; Chao, Kun-Mao | | | | |
1998 | Polynomial time approximation scheme for minimum routing cost spanning trees | Wu, Bang Ye; Lancia, Giuseppe; Bafna, Vineet; Chao, Kun-Mao; Ravi, R.; Tang, Chuan Yi; KUN-MA0 CHAO | Annual ACM-SIAM Symposium on Discrete Algorithms | | | |
2004 | Sequence Alignment | Chao, Kun-Mao | | | | |
- | Sequence Alignment | Chao, Kun-Mao; 趙坤茂 | | | | |
2005 | Sequence Alignment | Chao, Kun-Mao | | | | |
- | Shortest-paths trees | Wu, Bang-Ye; Chao, Kun-Mao | | | | |
- | Space-Saving Strategies for Computing Δ-points | Chao, Kun-Mao | | | | |
- | Spanning Trees and Optimization Problems (Excerpt)-Chapter 1 Counting Spanning Trees | Wu, Bang-Ye; Chao, Kun-Mao | | | | |
- | Spanning Trees and Optimization Problems (Excerpt)-Chapter 2 Minimum Spanning Trees | Wu, Bang-Ye; Chao, Kun-Mao | | | | |
- | Spanning Trees and Optimization Problems (Excerpt)-Chapter 3 Shortest-Paths Trees | Wu, Bang-Ye; Chao, Kun-Mao | | | | |