|
English
|
正體中文
|
简体中文
|
2831143
|
|
???header.visitor??? :
33153022
???header.onlineuser??? :
1118
???header.sponsordeclaration???
|
|
|
|
???tair.name??? >
???browser.page.title.author???
|
"fu hung lin"???jsp.browse.items-by-author.description???
Showing items 1-10 of 152 (16 Page(s) Totally)
1 2 3 4 5 6 7 8 9 10 > >>
View [10|25|50] records per page
| 國立交通大學 |
2020-10-05T02:02:03Z |
The undirected optical indices of complete m-ary trees
|
Lo, Yuan-Hsun; Fu, Hung-Lin; Zhang, Yijin; Wong, Wing Shing |
| 國立交通大學 |
2019-04-02T06:01:04Z |
(C)over-right-arrow(4)-decompositions of D-v\P and D-v boolean OR P where P is a 2-regular subgraph of D-v
|
Pu, Liqun; Fu, Hung-Lin; Shen, Hao |
| 國立交通大學 |
2019-04-02T06:00:52Z |
The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures
|
Lu, Hui-Chuan; Fu, Hung-Lin |
| 國立交通大學 |
2019-04-02T05:59:30Z |
Averting Cascading Failures in Networked Infrastructures: Poset-Constrained Graph Algorithms
|
Yu, Pei-Duo; Tan, Chee Wei; Fu, Hung-Lin |
| 國立交通大學 |
2019-04-02T05:58:52Z |
The Hamilton-Waterloo problem for Hamilton cycles and C-4k-factors
|
Lei, Hongchuan; Fu, Hung-Lin; Shen, Hao |
| 國立交通大學 |
2019-04-02T05:58:11Z |
(4,5)-CYCLE SYSTEMS OF COMPLETE MULTIPARTITE GRAPHS
|
Huang, Ming-Hway; Fu, Hung-Lin |
| 國立交通大學 |
2018-08-21T05:57:05Z |
Rumor Source Detection in Unicyclic Graphs
|
Yu, Pei-Duo; Tan, Chee Wei; Fu, Hung-Lin |
| 國立交通大學 |
2018-08-21T05:56:25Z |
Graph Algorithms for Preventing Cascading Failures in Networks
|
Yu, Pei Duo; Tan, Chee Wei; Fu, Hung-Lin |
| 國立交通大學 |
2018-08-21T05:54:19Z |
The Global Packing Number of a Fat-Tree Network
|
Lo, Yuan-Hsun; Zhang, Yijin; Chen, Yi; Fu, Hung-Lin; Wong, Wing Shing |
| 國立交通大學 |
2018-08-21T05:53:52Z |
On the number of rainbow spanning trees in edge-colored complete graphs
|
Fu, Hung-Lin; Lo, Yuan-Hsun; Perry, K. E.; Rodger, C. A. |
Showing items 1-10 of 152 (16 Page(s) Totally)
1 2 3 4 5 6 7 8 9 10 > >>
View [10|25|50] records per page
|
