完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Chen, Yung-Jui Jr | |
| dc.contributor.author | Lin, Min-Sheng Jr | |
| dc.date.accessioned | 2011-03-06T19:33:10Z | |
| dc.date.accessioned | 2020-05-18T03:22:15Z | - |
| dc.date.available | 2011-03-06T19:33:10Z | |
| dc.date.available | 2020-05-18T03:22:15Z | - |
| dc.date.issued | 2011-03-06T19:33:10Z | |
| dc.date.submitted | 2009-11-28 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/30041 | - |
| dc.description.abstract | This 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.sponsorship | National Taipei University,Taipei | |
| dc.format.extent | 5p. | |
| dc.relation.ispartofseries | NCS 2009 | |
| dc.subject | Minimum / Maximum Weighted Minimal Vertex Covers | |
| dc.subject | Weighted Trapezoid Graph | |
| dc.subject | Counting Problem | |
| dc.subject.other | Workshop on Algorithms and Bioinformatics | |
| dc.title | Counting the Number of Minimum / Maximum Weighted Minimal Vertex Covers in a Weighted Trapezoid Graph | |
| 分類: | 2009年 NCS 全國計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| AB 4-3.pdf | 201.06 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。