完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Kao, Kuo-Hua | |
| dc.contributor.author | Chang, Jou-Ming | |
| dc.contributor.author | Cheng, Yu-Wen | |
| dc.date.accessioned | 2009-08-23T04:50:03Z | |
| dc.date.accessioned | 2020-05-29T06:23:14Z | - |
| dc.date.available | 2009-08-23T04:50:03Z | |
| dc.date.available | 2020-05-29T06:23:14Z | - |
| dc.date.issued | 2006-10-13T06:43:13Z | |
| dc.date.submitted | 2005-12-15 | |
| dc.identifier.uri | http://dspace.fcu.edu.tw/handle/2377/1142 | - |
| dc.description.abstract | Reducible flowgraphs serve as useful vehicle in data flow analysis of computer programs. A reducible flowgraph is maximal (MRF for short) if no more edge can be added without violating reducibility. Based on a decomposition theorem of MRFs proposed in [Congr. Numer. 139 (1999) 9–20], a formula for counting the number of elementary cycles in MRFs is derived. Moreover, we propose an algorithm for generating all elementary cycles of an MRF when its corresponding decomposition tree is given. | |
| dc.description.sponsorship | 崑山大學,台南縣永康市 | |
| dc.format.extent | 8p. | |
| dc.format.extent | 331721 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 2005 NCS會議 | |
| dc.subject | elementary cycles | |
| dc.subject | reducible flowgraphs | |
| dc.subject | graph decomposition | |
| dc.subject | enumeration algorithms | |
| dc.subject.other | Bioinformatics Algorithm | |
| dc.title | Generating Elementary Cycles in Maximal Reducible Flowgraphs | |
| 分類: | 2005年 NCS 全國計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ncs002006000147.pdf | 323.95 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。