完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Lu, Chin | |
| dc.contributor.author | Tang, Chuan | |
| dc.date.accessioned | 2009-08-23T04:39:24Z | |
| dc.date.accessioned | 2020-05-25T06:25:42Z | - |
| dc.date.available | 2009-08-23T04:39:24Z | |
| dc.date.available | 2020-05-25T06:25:42Z | - |
| dc.date.issued | 2006-10-26 | |
| dc.date.submitted | 1996-12-19 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/2568 | - |
| dc.description.abstract | A perfect edge dominating set of G=(V,E) is a subset D of E such that every edge not in D is dominated by exactly one edge in D. The perfect edge domination problem is to find a perfect edge dominating set with the minimum cardinality in G. In this paper, we show that the perfect edge domination problem is NP-complete on bipartite graphs. Moreover, we present linear-time algorithms for solving the perfect edge domination problem on trees and series-parallel graphs. | |
| dc.description.sponsorship | 中山大學,高雄市 | |
| dc.format.extent | 8p. | |
| dc.format.extent | 569120 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 1996 ICS會議 | |
| dc.subject.other | Graph Algorithms | |
| dc.title | On the Complexity of the Perfect Edge Domination Problem | |
| 分類: | 1996年 ICS 國際計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics001996000111.pdf | 555.78 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。