完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Liang, Y. | |
| dc.date.accessioned | 2009-08-23T04:40:16Z | |
| dc.date.accessioned | 2020-05-25T06:25:15Z | - |
| dc.date.available | 2009-08-23T04:40:16Z | |
| dc.date.available | 2020-05-25T06:25:15Z | - |
| dc.date.issued | 2006-10-17T08:30:50Z | |
| dc.date.submitted | 1998-12-17 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/1788 | - |
| dc.description.abstract | This paper presents an O(log2n)time,n2 processor EREW PRAM algorithm to determine if there is a Hamiltonian circuit in a convex bipartite graph. If there is a Hamiltonian circuit,we can fint it within the same resource bounds | |
| dc.description.sponsorship | 成功大學,台南市 | |
| dc.format.extent | 8p. | |
| dc.format.extent | 708331 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 1998 ICS會議 | |
| dc.subject | circular convex bipartite graphs | |
| dc.subject | convex bipartite graphs | |
| dc.subject | Hamiltonian circuits, | |
| dc.subject | NC | |
| dc.subject | Maximum matching | |
| dc.subject | parallel algorithms | |
| dc.subject.other | Parallel Algorithms | |
| dc.title | Parallel algorithms for the hamiltonian circuit problem in convex bipartite graphs and circular convex bipartite graphs | |
| 分類: | 1998年 ICS 國際計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics001998000033.pdf | 691.73 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。