完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Lee, Chuan-Min | |
| dc.contributor.author | Chang, Maw-Shang | |
| dc.date.accessioned | 2009-06-02T06:37:36Z | |
| dc.date.accessioned | 2020-05-25T06:40:55Z | - |
| dc.date.available | 2009-06-02T06:37:36Z | |
| dc.date.available | 2020-05-25T06:40:55Z | - |
| dc.date.issued | 2006-10-18T07:50:45Z | |
| dc.date.submitted | 2004-12-15 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/1878 | - |
| dc.description.abstract | In this paper, we show that minimum clique-transversal and maximum clique-independent sets of a distance-hereditary graph have the same cardinality, and the clique-transversal set problem can be solved in O(n + m) time and the clique-independent set problem can be solved in O(n2) time for distancehereditary graphs. | |
| dc.description.sponsorship | 大同大學,台北市 | |
| dc.format.extent | 6p. | |
| dc.format.extent | 317025 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 2004 ICS會議 | |
| dc.subject | Algorithm | |
| dc.subject | Clique-Transversal Set | |
| dc.subject | Clique-Independent Set | |
| dc.subject | Distance-Hereditary Graph | |
| dc.subject.other | Miscellaneous | |
| dc.title | The Clique-Transversal and the Clique-Independent Set Problems on Distance-Hereditary Graphs | |
| 分類: | 2004年 ICS 國際計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics002004000236.pdf | 309.59 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。