完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Peng, Sheng-Lung | |
| dc.contributor.author | Chao, Hsiao-An | |
| dc.contributor.author | Chang, Ruay-Shiung | |
| dc.date.accessioned | 2009-06-02T06:19:30Z | |
| dc.date.accessioned | 2020-05-25T06:38:35Z | - |
| dc.date.available | 2009-06-02T06:19:30Z | |
| dc.date.available | 2020-05-25T06:38:35Z | - |
| dc.date.issued | 2006-10-25T05:46:55Z | |
| dc.date.submitted | 2000-12-08 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/2481 | - |
| dc.description.abstract | The maximum connected interval subgraph problem on a graph G is the problem of nding an induced subgraph H of G such that H is a connected interval graph with the maximum number of vertices. It has been shown that this problem is NP-hard and have no constant ratio approximation on general graphs. In this paper, we propose linear-time algorithms for solving this problem on block graphs and chain graphs. | |
| dc.description.sponsorship | 中正大學,嘉義縣 | |
| dc.format.extent | 6p. | |
| dc.format.extent | 216976 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 2000 ICS會議 | |
| dc.subject.other | Graph Algorithms | |
| dc.title | On the maximum connected interval subgraph of block grraphs and chain graphs | |
| 分類: | 2000年 ICS 國際計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics002000000002.pdf | 211.89 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。