完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Wang, Fu–Hsing | |
| dc.contributor.author | Chang, Jou–Ming | |
| dc.contributor.author | Wang, Yue–Li | |
| dc.contributor.author | Hsu, Cheng–Ju | |
| dc.date.accessioned | 2009-08-23T04:47:26Z | |
| dc.date.accessioned | 2020-05-29T06:16:29Z | - |
| dc.date.available | 2009-08-23T04:47:26Z | |
| dc.date.available | 2020-05-29T06:16:29Z | - |
| dc.date.issued | 2006-10-13T02:43:33Z | |
| dc.date.submitted | 2001-12-20 | |
| dc.identifier.uri | http://dspace.fcu.edu.tw/handle/2377/1138 | - |
| dc.description.abstract | A dominating set S of a directed graph D is a set of vertices such that every vertex not in S is dominated by at least one vertex of S. In this paper, we show that there is a unique minimum distance-k dominating set, for k = 1, 2, in a directed split-star, which has recently been developed as a new model of the interconnection network for parallel and distributed computing systems. | |
| dc.description.sponsorship | 中國文化大學,台北市 | |
| dc.format.extent | 6p. | |
| dc.format.extent | 186351 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 2001 NCS會議 | |
| dc.subject | Dominating set | |
| dc.subject | Interconnection network | |
| dc.subject | Directed split-star | |
| dc.subject.other | Algorithm potpourri | |
| dc.title | The Unique Minimum Dominating Set of Directed Split-Stars | |
| dc.title.alternative | 有向分割星狀網路的唯一最小支配集合 | |
| 分類: | 2001年 NCS 全國計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ncs002001000007.pdf | 181.98 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。