|
|
Taiwan Academic Institutional Repository >
Browse by Author
|
"hsu lh"
Showing items 51-75 of 83 (4 Page(s) Totally)
<< < 1 2 3 4 > >>
View [10|25|50] records per page
| 國立交通大學 |
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 |
Showing items 51-75 of 83 (4 Page(s) Totally)
<< < 1 2 3 4 > >>
View [10|25|50] records per page
|
