完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Yen, Chung-Kung | |
| dc.date.accessioned | 2009-08-23T04:47:30Z | |
| dc.date.accessioned | 2020-05-29T06:16:34Z | - |
| dc.date.available | 2009-08-23T04:47:30Z | |
| dc.date.available | 2020-05-29T06:16:34Z | - |
| dc.date.issued | 2006-10-13T02:36:36Z | |
| dc.date.submitted | 2001-12-20 | |
| dc.identifier.uri | http://dspace.fcu.edu.tw/handle/2377/1127 | - |
| dc.description.abstract | Let G(V, E, W) be a graph with n-vertexset V and m-edge-set E, where W is a cost function which maps V to real costs. For any subset H of V, the bottleneck cost of H is defined as b(H) = maxxÎH{W(x)}. The main goal of this research is to identify a certain type of dominating set of G such that its bottleneck cost is minimized. | |
| dc.description.sponsorship | 中國文化大學,台北市 | |
| dc.format.extent | 12p. | |
| dc.format.extent | 106205 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 2001 NCS會議 | |
| dc.subject | 完美支配集 | |
| dc.subject | 瓶頸配置成本與總和通訊成本 | |
| dc.subject | 二裂圖形 | |
| dc.subject | 區塊圖形 | |
| dc.subject | 樹 | |
| dc.subject | 支配集 | |
| dc.subject.other | Algorithm potpourri | |
| dc.title | Domination and Perfect Domination under Bottleneck Cost | |
| dc.title.alternative | 瓶頸成本最佳化支配與完美支配問題及其擴充 | |
| 分類: | 2001年 NCS 全國計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ncs002001000006.pdf | 103.72 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。