|
English
|
正體中文
|
简体中文
|
總筆數 :0
|
|
造訪人次 :
52472394
線上人數 :
1127
教育部委託研究計畫 計畫執行:國立臺灣大學圖書館
|
|
|
"hsu lh"的相關文件
顯示項目 56-65 / 83 (共9頁)
<< < 1 2 3 4 5 6 7 8 9 > >>
每頁顯示[10|25|50]項目
| 國立交通大學 |
2014-12-08T15:05:32Z |
GENERALIZED HOMOMORPHISM GRAPH FUNCTIONS
|
HSU, LH |
| 國立交通大學 |
2014-12-08T15:05:23Z |
UNORDERED TREE CONTRACTION
|
HSU, LH; WANG, JJJ |
| 國立交通大學 |
2014-12-08T15:05:21Z |
A LINEAR-TIME ALGORITHM TO RECOGNIZE THE DOUBLE EULER TRAIL FOR SERIES-PARALLEL NETWORKS
|
HSU, LH; HWANG, JY; HO, TY; TSAI, CH |
| 國立交通大學 |
2014-12-08T15:05:12Z |
MAXIMUM INDEPENDENT NUMBER FOR SERIES-PARALLEL NETWORKS
|
HSU, LH; WANG, SY |
| 國立交通大學 |
2014-12-08T15:05:09Z |
FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE IN WEIGHTED GRAPHS
|
HSU, LH; JAN, RH; LEE, YC; HUNG, CN; CHERN, MS |
| 國立交通大學 |
2014-12-08T15:05:04Z |
PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE
|
HSU, LH; WANG, PF; WU, CT |
| 國立交通大學 |
2014-12-08T15:05:04Z |
DATA STRUCTURE FOR GRAPH REPRESENTATIONS OF A NETWORK HAVING DOUBLE EULER TRAILS
|
SUNG, TY; HSU, LH; HWANG, JY |
| 國立交通大學 |
2014-12-08T15:05:03Z |
THE MOST VITAL EDGES WITH RESPECT TO THE NUMBER OF SPANNING-TREES IN 2-TERMINAL SERIES-PARALLEL GRAPHS
|
JAN, RH; HSU, LH; LEE, YY |
| 國立交通大學 |
2014-12-08T15:04:47Z |
PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE
|
HSU, LH; WANG, PF; WU, CT |
| 國立交通大學 |
2014-12-08T15:04:28Z |
THE MOST VITAL EDGES OF MATCHING IN A BIPARTITE GRAPH
|
HUNG, CN; HSU, LH; SUNG, TY |
顯示項目 56-65 / 83 (共9頁)
<< < 1 2 3 4 5 6 7 8 9 > >>
每頁顯示[10|25|50]項目
|
