公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 |
2008 | Bandwidth-constrained routing problem in wireless ad-hoc networks | Chiu, C. Y.; Kuo, Y. L.; Wu, E. H. K.; Chen, G. H. | IEEE Transactions on Parallel and Distributed Systems | | | |
2002 | Constructing one-to-many disjoint paths in folded hypercubes | Lai, C. N.; Chen, G. H.; Duh, D. R. | IEEE Transactions on Computers | | | |
2000 | Hypercomplete: a pancyclic recursive topology for large-scale distributed multicomputer systems | Chen, G. H.; Fu, J. S.; Fang, J. F. | Networks | | | |
2001 | Longest fault-free paths in star graphs with edge faults | Hsieh, S. Y.; Chen, G. H.; Ho, C. W. | IEEE Transactions on Computers | | | |
2002 | Node-disjoint paths and related problems on hierarchical cubic networks | Fu, J. S.; Chen, G. H.; Duh, D. R. | Networks | | | |
1999 | Parallel decomposition of generalized series-parallel graphs | Ho, C. W.; Hsieh, S. Y.; Chen, G. H. | Journal of Information Science and Engineering | 0 | 0 | |
2006 | (t,k)-diagnosis for matching composition networks | Chang, G. Y.; Chen, G. H.; Chang, G. J. | IEEE Transactions on Computers | | | |
2007 | (t,k)-diagnosis for matching composition networks under the MM* model | Chang, G. Y.; Chen, G. H.; Chang, G. J. | IEEE Transactions on Computers | 37 | 34 | |
1989 | Using fewer processors to reduce time complexities of semigroup computations | Chen, Y. C.; Yeh, Z. C.; Chen, G. H. | Information Processing Letters | | | |