|
|
Taiwan Academic Institutional Repository >
Browse by Author
|
"hsu lh"
Showing items 41-65 of 83 (4 Page(s) Totally)
<< < 1 2 3 4 > >>
View [10|25|50] records per page
| 國立交通大學 |
2014-12-08T15:37:13Z |
Diagnosability of t-connected networks and product networks under the comparison diagnosis model
|
Chang, CP; Lai, PL; Tan, JJM; Hsu, LH |
| 國立交通大學 |
2014-12-08T15:35:57Z |
Fault-tolerant pancyclicity of the Mobius cubes
|
Yang, MC; Li, TK; Tan, JJM; Hsu, LH |
| 國立交通大學 |
2014-12-08T15:35:53Z |
Spider web networks: a family of optimal, fault tolerant, hamiltoman bipartite graphs
|
Kao, SS; Hsu, LH |
| 國立交通大學 |
2014-12-08T15:27:29Z |
A new shortest path routing algorithm and embedding cycles of crossed cube
|
Chang, CP; Sung, TY; Hsu, LH |
| 國立交通大學 |
2014-12-08T15:27:20Z |
Broadcasting on wormhole-routed 2D tori with arbitrary size
|
Hou, YM; Wang, CM; Tsai, MJ; Hsu, LH |
| 國立交通大學 |
2014-12-08T15:27:19Z |
1-fault tolerant design for token rings
|
Wang, JJ; Hung, CN; Hsu, LH |
| 國立交通大學 |
2014-12-08T15:25:28Z |
Cycles in highly faulty hypercubes
|
Yang, MC; Tan, JJM; Hsu, LH |
| 國立交通大學 |
2014-12-08T15:19:44Z |
Conditional diagnosability measures for large multiprocessor systems
|
Lai, PL; Tan, JJM; Chang, CP; Hsu, LH |
| 國立交通大學 |
2014-12-08T15:19:41Z |
Honeycomb rectangular disks
|
Teng, YH; Tan, JJM; Hsu, LH |
| 國立交通大學 |
2014-12-08T15:18:52Z |
The super connectivity of the pancake graphs and the super laceability of the star graphs
|
Lin, CK; Huang, HM; Hsu, LH |
| 國立交通大學 |
2014-12-08T15:17:03Z |
On embed-ding cycles into faulty twisted cubes
|
Yang, MC; Li, TK; Tan, JJM; Hsu, LH |
| 國立交通大學 |
2014-12-08T15:16:59Z |
On mutually independent hamiltonian paths
|
Teng, YH; Tan, JJM; Ho, TY; Hsu, LH |
| 國立交通大學 |
2014-12-08T15:06:21Z |
ON A MULTIPLICATIVE GRAPH FUNCTION CONJECTURE
|
HSU, LH |
| 國立交通大學 |
2014-12-08T15:06:15Z |
DEPENDENCE OF TREE COPY FUNCTIONS
|
HSU, LH |
| 國立交通大學 |
2014-12-08T15:06:04Z |
A CLASS OF ADDITIVE MULTIPLICATIVE GRAPH FUNCTIONS
|
HSU, LH; CHEN, C; JEAN, EY |
| 國立交通大學 |
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 |
Showing items 41-65 of 83 (4 Page(s) Totally)
<< < 1 2 3 4 > >>
View [10|25|50] records per page
|
