完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Tsui, Kai Wen | |
| dc.contributor.author | Yen, Chung-Kung | |
| dc.contributor.author | Tang, Chuan Yi | |
| dc.date.accessioned | 2009-08-23T04:51:07Z | |
| dc.date.accessioned | 2020-05-29T06:38:42Z | - |
| dc.date.available | 2009-08-23T04:51:07Z | |
| dc.date.available | 2020-05-29T06:38:42Z | - |
| dc.date.issued | 2008-07-21T02:01:23Z | |
| dc.date.submitted | 2007-12-20 | |
| dc.identifier.uri | http://dspace.fcu.edu.tw/handle/2377/10710 | - |
| dc.description.abstract | This paper studies the problem of partitioning the vertices of a graph G into disjoint set V1, …, Vq such that V1, …, Va are all dominating sets of G. The objective is to find the largest q. We first propose a 0-1 matrix representation of bipartite permutation graphs. Then, a linear-time algorithm for domatic number problem on bipartite permutation graphs is designed. | |
| dc.description.sponsorship | 亞洲大學資訊學院, 台中縣霧峰鄉 | |
| dc.format.extent | 5p. | |
| dc.relation.ispartofseries | 2007 NCS會議 | |
| dc.subject | domatic number | |
| dc.subject | dominating set | |
| dc.subject | domatic partition | |
| dc.subject | bipartite permutation graph | |
| dc.subject.other | Algorithms | |
| dc.title | On The Domatic Number of Bipartite Permutation Graphs | |
| 分類: | 2007年 NCS 全國計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| CE07NCS002007000076.pdf | 82.65 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。