| 標題: | 組合最優化及相關圖論問題 Combinatorial Optimization and Related Graph Problems |
| 作者: | 張鎮華 Chang Gerard Jennhwa 交通大學應用數學系 |
| 關鍵字: | 組合最優化;圖論;最優剖分;著色問題;區間數;寬直徑;Hamiltonian問題;Combinatorial optimization;Graph theory;Optimal partition;Coloring problem;Interval number;Wide diameter;Hamiltonian problem |
| 公開日期: | 1999 |
| 官方說明文件#: | NSC88-2115-M009-009 |
| URI: | http://hdl.handle.net/11536/94415 https://www.grb.gov.tw/search/planDetail?id=425509&docId=75938 |
| 顯示於類別： | 研究計畫 |
- 組合最優化的幾個問題 / 張鎮華;Chang Gerard Jennhwa
- 圖論中之寬直徑、著色、控制集、區間數等問題 / 張鎮華;Chang Gerard Jennhwa
- 針對解最佳電力潮流問題的對應型方法的改進 / 林心宇;LIN SHIN-YEU
- A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance / Chen, Y-Chuang;Huang, Yong-Zen;Hsu, Lih-Hsing;Tan, Jimmy J. M.
- Learning a hidden graph / Chang, Huilan;Fu, Hung-Lin;Shih, Chih-Huai
- Any maximal planar graph with only one separating triangle is hamiltonian / Chen, CY
- 迪布恩圖的直徑與寬直徑 / 郭志銘;Jyh-Min Kuo;傅恆霖;Hung-Lin Fu
- The approximability of the weighted Hamiltonian path completion problem on a tree / Wu, Q;Lu, CL;Lee, RCT
- Vertex and tree arboricities of graphs / Chang, GJ;Chen, CY;Chen, YP
Loading...