| 標題: | 一個解決圖形上史丹納問題之分枝界定演算法 A branch-and-bound algorithm for the Steiner problem in graphs |
| 作者: | 王麗琇 陳榮傑 資訊科學與工程研究所 |
| 公開日期: | 1987 |
| URI: | http://140.113.39.130/cdrfb3/record/nctu/#NT762392001 http://hdl.handle.net/11536/53367 |
| Appears in Collections: | Thesis |
- A factoring approach for the Steiner tree problem in undirected networks / Wang, Chu-Fu;Jan, Rong-Hong
- On the full and bottleneck full Steiner tree problems / Chen, YH;Lu, CL;Tang, CY
- Heuristic algorithms for packing of multiple-group multicasting / Wang, CF;Liang, CT;Jan, RH
- The full Steiner tree problem / Lu, CL;Tang, CY;Lee, RCT
- A Maze Routing-Based Algorithm for ML-OARST with Pre-Selecting and Re-Building Steiner Points / Lin, Kuen-Wey;Lin, Yeh-Sheng;Li, Yih-Lang;Lin, Rung-Bin
- Weighted connected domination and Steiner trees in distance-hereditary graphs / Yeh, HG;Chang, GJ
- Optimum multicast of multimedia streams / Wang, CF;Lai, BR;Jan, RH
- On computing the minimum feedback vertex set of a directed graph by contraction operations / Lin, HM;Jou, JY
Loading...