完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Wang, Fu–Hsing | |
dc.contributor.author | Wang, Yue–Li | |
dc.contributor.author | Chang, Jou–Ming | |
dc.date.accessioned | 2009-08-23T04:41:50Z | |
dc.date.accessioned | 2020-05-25T06:42:07Z | - |
dc.date.available | 2009-08-23T04:41:50Z | |
dc.date.available | 2020-05-25T06:42:07Z | - |
dc.date.issued | 2006-10-16T03:56:08Z | |
dc.date.submitted | 2002-12-18 | |
dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/1501 | - |
dc.description.abstract | In a graph G = (V,E), a subset F(G) of V (G) is a feedback vertex set if the subgraph induced by V (G) \ F(G) is acyclic. In this paper, we find a lower bound and an upper bound to the size of the feedback vertex set for star graphs. | |
dc.description.sponsorship | 東華大學,花蓮縣 | |
dc.format.extent | 13p. | |
dc.format.extent | 138438 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | zh_TW | |
dc.relation.ispartofseries | 2002 ICS會議 | |
dc.subject | Feedback vertex set | |
dc.subject | Interconnection network | |
dc.subject | Star graphs | |
dc.title | Feedback Vertex Sets in Star Graphs | |
分類: | 2002年 ICS 國際計算機會議 |
文件中的檔案:
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
ce07ics002002000148.PDF | 135.19 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。