完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Chang, Maw-Shang | |
| dc.contributor.author | Yang, Rue-Lin | |
| dc.date.accessioned | 2009-08-23T04:39:57Z | |
| dc.date.accessioned | 2020-05-25T06:23:46Z | - |
| dc.date.available | 2009-08-23T04:39:57Z | |
| dc.date.available | 2020-05-25T06:23:46Z | - |
| dc.date.issued | 2006-10-24T08:55:34Z | |
| dc.date.submitted | 1998-12-17 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/2410 | - |
| dc.description.abstract | An edge dominating set D of a graph G=(V,E) is a set of edges such that every edge not in D is adjacent to at least one edge in D. This paper gives an O(n4) time algorithm which finds a minimum edge dominating set for a distance-hereditary graph where n=│V│. | |
| dc.description.sponsorship | 成功大學,台南市 | |
| dc.format.extent | 4p. | |
| dc.format.extent | 339873 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 1998 ICS會議 | |
| dc.subject.other | Graph Algorithms | |
| dc.title | Edge domination of distance-hereditary graphs | |
| 分類: | 1998年 ICS 國際計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics001998000044.pdf | 331.91 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。