完整後設資料紀錄
DC 欄位語言
dc.contributor.authorWang, Fu–Hsing
dc.contributor.authorWang, Yue–Li
dc.contributor.authorChang, Jou–Ming
dc.date.accessioned2009-08-23T04:41:50Z
dc.date.accessioned2020-05-25T06:42:07Z-
dc.date.available2009-08-23T04:41:50Z
dc.date.available2020-05-25T06:42:07Z-
dc.date.issued2006-10-16T03:56:08Z
dc.date.submitted2002-12-18
dc.identifier.urihttp://dspace.lib.fcu.edu.tw/handle/2377/1501-
dc.description.abstractIn 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.extent13p.
dc.format.extent138438 bytes
dc.format.mimetypeapplication/pdf
dc.language.isozh_TW
dc.relation.ispartofseries2002 ICS會議
dc.subjectFeedback vertex set
dc.subjectInterconnection network
dc.subjectStar graphs
dc.titleFeedback Vertex Sets in Star Graphs
分類:2002年 ICS 國際計算機會議

文件中的檔案:
檔案 描述 大小格式 
ce07ics002002000148.PDF135.19 kBAdobe PDF檢視/開啟


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。