完整後設資料紀錄
DC 欄位語言
dc.contributor.authorChen, Yung-Jui Jr
dc.contributor.authorLin, Min-Sheng Jr
dc.date.accessioned2011-03-06T19:33:10Z
dc.date.accessioned2020-05-18T03:22:15Z-
dc.date.available2011-03-06T19:33:10Z
dc.date.available2020-05-18T03:22:15Z-
dc.date.issued2011-03-06T19:33:10Z
dc.date.submitted2009-11-28
dc.identifier.urihttp://dspace.lib.fcu.edu.tw/handle/2377/30041-
dc.description.abstractThis study presents an O(n2)-time algorithm for counting the number of minimum weighted minimal vertex covers and maximum weighted minimal vertex covers in a weighted trapezoid graph simultaneously.
dc.description.sponsorshipNational Taipei University,Taipei
dc.format.extent5p.
dc.relation.ispartofseriesNCS 2009
dc.subjectMinimum / Maximum Weighted Minimal Vertex Covers
dc.subjectWeighted Trapezoid Graph
dc.subjectCounting Problem
dc.subject.otherWorkshop on Algorithms and Bioinformatics
dc.titleCounting the Number of Minimum / Maximum Weighted Minimal Vertex Covers in a Weighted Trapezoid Graph
分類:2009年 NCS 全國計算機會議

文件中的檔案:
檔案 描述 大小格式 
AB 4-3.pdf201.06 kBAdobe PDF檢視/開啟


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