1. 目前位置：

瀏覽 的方式： 作者 HSU, LH

跳到： 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
或是輸入前幾個字：  
顯示 1 到 20 筆資料，總共 21 筆  下一頁 >
公開日期標題作者
1-五月-1987A CLASS OF ADDITIVE MULTIPLICATIVE GRAPH FUNCTIONSHSU, LH; CHEN, C; JEAN, EY; 交大名義發表; 應用數學系; National Chiao Tung University; Department of Applied Mathematics
1992DATA STRUCTURE FOR GRAPH REPRESENTATIONS OF A NETWORK HAVING DOUBLE EULER TRAILSSUNG, TY; HSU, LH; HWANG, JY; 資訊工程學系; Department of Computer Science
1985DEPENDENCE OF TREE COPY FUNCTIONSHSU, LH; 交大名義發表; 應用數學系; National Chiao Tung University; Department of Applied Mathematics
13-一月-1995ELEMENT PERTURBATION PROBLEMS OF OPTIMUM SPANNING-TREES WITH 2-PARAMETER OBJECTIVESCHANG, YC; HSU, LH; 資訊工程學系; Department of Computer Science
1994ELEMENT PERTURBATION PROBLEMS OF OPTIMUM SPANNING-TREES WITH 2-PARAMETER OBJECTIVESCHANG, YC; HSU, LH; 資訊科學與工程研究所; Institute of Computer Science and Engineering
1-九月-1993FINDING THE MOST VITAL EDGE WITH RESPECT TO K-TERMINAL RELIABILITY IN SERIES-PARALLEL NETWORKSWANG, PF; HSU, LH; 資訊工程學系; Department of Computer Science
13-九月-1991FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE IN WEIGHTED GRAPHSHSU, LH; JAN, RH; LEE, YC; HUNG, CN; CHERN, MS; 資訊工程學系; Department of Computer Science
1-十二月-1994FINDING THE MOST VITAL EDGES WITH RESPECT TO THE NUMBER OF SPANNING-TREESTSEN, FSP; SUNG, TY; LIN, MY; HSU, LH; MYRVOLD, W; 應用數學系; 資訊工程學系; Department of Applied Mathematics; Department of Computer Science
1-八月-1990GENERALIZED HOMOMORPHISM GRAPH FUNCTIONSHSU, LH; 應用數學系; 資訊工程學系; Department of Applied Mathematics; Department of Computer Science
1991A LINEAR-TIME ALGORITHM TO RECOGNIZE THE DOUBLE EULER TRAIL FOR SERIES-PARALLEL NETWORKSHSU, LH; HWANG, JY; HO, TY; TSAI, CH; 資訊工程學系; Department of Computer Science
1-七月-1991MAXIMUM INDEPENDENT NUMBER FOR SERIES-PARALLEL NETWORKSHSU, LH; WANG, SY; 交大名義發表; 資訊工程學系; National Chiao Tung University; Department of Computer Science
1-七月-1993THE MOST VITAL EDGES OF MATCHING IN A BIPARTITE GRAPHHUNG, CN; HSU, LH; SUNG, TY; 資訊工程學系; Department of Computer Science
1992THE MOST VITAL EDGES WITH RESPECT TO THE NUMBER OF SPANNING-TREES IN 2-TERMINAL SERIES-PARALLEL GRAPHSJAN, RH; HSU, LH; LEE, YY; 資訊工程學系; Department of Computer Science
1-五月-1994A NOTE ON THE MINIMUM CUT COVER OF GRAPHSHO, TY; HSU, LH; 交大名義發表; 資訊工程學系; National Chiao Tung University; Department of Computer Science
1983ON A MULTIPLICATIVE GRAPH FUNCTION CONJECTUREHSU, LH; 交大名義發表; 應用數學系; National Chiao Tung University; Department of Applied Mathematics
1-七月-1995AN OPTIMAL ALGORITHM FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO SKT RELIABILITY IN BSP DIGRAPHSWANG, PF; LEU, SC; HSU, LH; 資訊工程學系; Department of Computer Science
1992PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREEHSU, LH; WANG, PF; WU, CT; 資訊工程學系; Department of Computer Science
1992PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREEHSU, LH; WANG, PF; WU, CT; 資訊工程學系; Department of Computer Science
1-一月-1992PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREEHSU, LH; WANG, PF; WU, CT; 資訊工程學系; Department of Computer Science
1-一月-1992PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREEHSU, LH; WANG, PF; WU, CT; 資訊工程學系; Department of Computer Science
顯示 1 到 20 筆資料，總共 21 筆  下一頁 >