| 題名: | Generating Elementary Cycles in Maximal Reducible Flowgraphs |
| 作者: | Kao, Kuo-Hua Chang, Jou-Ming Cheng, Yu-Wen |
| 關鍵字: | elementary cycles reducible flowgraphs graph decomposition enumeration algorithms |
| 期刊名/會議名稱: | 2005 NCS會議 |
| 摘要: | 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. |
| 日期: | 2006-10-13T06:43:13Z |
| 分類: | 2005年 NCS 全國計算機會議 |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ncs002006000147.pdf | 323.95 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。