| 國立交通大學 |
2014-12-08T15:41:56Z |
Fault-tolerant hamiltonian laceability of hypercubes
|
Tsai, CH; Tan, JJM; Liang, TN; Hsu, LH |
| 國立交通大學 |
2014-12-08T15:41:56Z |
A note on the ultimate categorical matching in a graph
|
Hsu, LH |
| 國立交通大學 |
2014-12-08T15:41:49Z |
Optimal 1-edge fault-tolerant designs for ladders
|
Chuang, YC; Hsu, LH; Chang, CH |
| 國立交通大學 |
2014-12-08T15:40:46Z |
Ring embedding in faulty pancake graphs
|
Hung, CN; Hsu, HC; Liang, KY; Hsu, LH |
| 國立交通大學 |
2014-12-08T15:40:46Z |
Brother trees: A family of optimal 1(p)-hamiltonian and 1-edge hamiltonian graphs
|
Kao, SS; Hsu, LH |
| 國立交通大學 |
2014-12-08T15:40:36Z |
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
|
Li, TK; Tsai, CH; Tan, JJM; Hsu, LH |
| 國立交通大學 |
2014-12-08T15:40:30Z |
Super-connectivity and super-edge-connectivity for some interconnection networks
|
Chen, YC; Tan, JJM; Hsu, LH; Kao, SS |
| 國立交通大學 |
2014-12-08T15:40:06Z |
Fault-tolerant cycle-embedding of crossed cubes
|
Yang, MC; Li, TK; Tan, JJM; Hsu, LH |
| 國立交通大學 |
2014-12-08T15:40:02Z |
Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)-star graphs
|
Hsu, HC; Hsieh, YL; Tan, JJM; Hsu, LH |
| 國立交通大學 |
2014-12-08T15:39:46Z |
Fault hamiltonicity and fault hamiltonian connectivity of the arrangement graphs
|
Hsu, HC; Li, TK; Tan, JJM; Hsu, LH |
| 國立交通大學 |
2014-12-08T15:39:43Z |
On some super fault-tolerant Hamiltonian graphs
|
Chen, YC; Tsai, CH; Hsu, LH; Tan, JJM |
| 國立交通大學 |
2014-12-08T15:38:44Z |
The diagnosability of the matching composition network under the comparison diagnosis model
|
Lai, PL; Tan, JJM; Tsai, CH; Hsu, LH |
| 國立交通大學 |
2014-12-08T15:38:32Z |
Hyper hamiltonian laceability on edge fault star graph
|
Li, TK; Tar, JJM; Hsu, LH |
| 國立交通大學 |
2014-12-08T15:38:30Z |
The super-connected property of recursive circulant graphs
|
Tsai, CH; Tan, JJM; Hsu, LH |
| 國立交通大學 |
2014-12-08T15:37:26Z |
The super laceability of the hypercubes
|
Chang, CH; Lin, CK; Huang, HM; Hsu, LH |
| 國立交通大學 |
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 |
| 國立交通大學 |
2014-12-08T15:04:24Z |
FINDING THE MOST VITAL EDGE WITH RESPECT TO K-TERMINAL RELIABILITY IN SERIES-PARALLEL NETWORKS
|
WANG, PF; HSU, LH |
| 國立交通大學 |
2014-12-08T15:04:12Z |
ELEMENT PERTURBATION PROBLEMS OF OPTIMUM SPANNING-TREES WITH 2-PARAMETER OBJECTIVES
|
CHANG, YC; HSU, LH |
| 國立交通大學 |
2014-12-08T15:04:01Z |
A NOTE ON THE MINIMUM CUT COVER OF GRAPHS
|
HO, TY; HSU, LH |
| 國立交通大學 |
2014-12-08T15:03:40Z |
FINDING THE MOST VITAL EDGES WITH RESPECT TO THE NUMBER OF SPANNING-TREES
|
TSEN, FSP; SUNG, TY; LIN, MY; HSU, LH; MYRVOLD, W |
| 國立交通大學 |
2014-12-08T15:03:34Z |
ELEMENT PERTURBATION PROBLEMS OF OPTIMUM SPANNING-TREES WITH 2-PARAMETER OBJECTIVES
|
CHANG, YC; HSU, LH |
| 國立交通大學 |
2014-12-08T15:03:18Z |
AN OPTIMAL ALGORITHM FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO SKT RELIABILITY IN BSP DIGRAPHS
|
WANG, PF; LEU, SC; HSU, LH |
| 國立交通大學 |
2014-12-08T15:02:49Z |
Transmitting on various network topologies
|
Ho, TY; Hsu, LH; Sung, TY |
| 國立交通大學 |
2014-12-08T15:02:49Z |
A classification of graph capacity functions
|
Hsu, LH |
| 國立交通大學 |
2014-12-08T15:02:42Z |
A response to Volgenant's addendum on the most vital edges
|
Hung, CN; Hsu, LH; Sung, TY |
| 國立交通大學 |
2014-12-08T15:02:29Z |
On minimal cost-reliability ratio spanning trees and related problems
|
Chang, YC; Hsu, LH |
