|
English
|
正體中文
|
简体中文
|
總筆數 :0
|
|
造訪人次 :
52202895
線上人數 :
1263
教育部委託研究計畫 計畫執行:國立臺灣大學圖書館
|
|
|
顯示項目 429311-429320 / 2348487 (共234849頁)
<< < 42927 42928 42929 42930 42931 42932 42933 42934 42935 42936 > >>
每頁顯示[10|25|50]項目
| 國立臺灣大學 |
2003 |
Finding a Length-Constrained Maximum-Density Path in a Tree
|
Lin, R.-R.; Kuo, W.-H.; Chao, K.-M. |
| 臺大學術典藏 |
2018-09-10T05:20:01Z |
Finding a length-constrained maximum-density path in a tree
|
Lin, R.-R.; Kuo, W.-H.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T04:30:43Z |
Finding a length-constrained maximum-density path in a tree
|
Lin, R.-R.; Kuo, W.-H.; Chao, K.-M.; KUN-MA0 CHAO |
| 國立暨南國際大學 |
2008 |
Finding a longest common subsequence between a run-length-encoded string and an uncompressed string
|
李家同; Lee, RCT |
| 國立暨南國際大學 |
2008 |
Finding a longest common subsequence between a run-length-encoded string and an uncompressed string
|
王有禮; Wang, YL |
| 國立臺灣科技大學 |
2007 |
Finding a Longest Common Subsequence between a Run-Length-Encoded String and an Uncompressed String
|
Liu, J. J. ;Wang, Y. L.;Lee, R.C.T. |
| 國立臺灣科技大學 |
2008 |
Finding a longest common subsequence between a run-length-encoded string and an uncompressed string
|
Liu, J.J.;Wang, Y.L.;Lee, R.C.T. |
| 臺大學術典藏 |
2018-09-10T06:04:30Z |
Finding a Maximum Clique in an Arbitrary Graph
|
CHANG-SUNG YU; CHANG-SUNG YU; CHANG-SUNG YU |
| 臺大學術典藏 |
2020-03-06T03:40:39Z |
FINDING A MAXIMUM CLIQUE IN AN ARBITRARY GRAPH.
|
Balas Egon, Yu Chang Sung; Balas Egon, Yu Chang Sung; CHANG-SUNG YU |
| 臺大學術典藏 |
1992 |
Finding a Maximum Clique in Large-Scale Graphs
|
Yu, Chang-Sung; Yu, Chang-Sung |
顯示項目 429311-429320 / 2348487 (共234849頁)
<< < 42927 42928 42929 42930 42931 42932 42933 42934 42935 42936 > >>
每頁顯示[10|25|50]項目
|
