AN OPTIMAL ALGORITHM FOR CYCLE BREAKING IN DIRECTED-GRAPHS

被引：26
|
作者：
ORENSTEIN, T
KOHAVI, Z
POMERANZ, I
机构：
[1] TECHNION ISRAEL INST TECHNOL,DEPT COMP SCI,IL-32000 HAIFA,ISRAEL
[2] UNIV IOWA,DEPT ELECT & COMP ENGN,IOWA CITY,IA 52242
来源：
JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS | 1995年 / 7卷 / 1-2期
关键词：
FEEDBACK VERTEX SET; WEIGHTED FEEDBACK VERTEX SET; GRAPH REDUCTION; GRAPH PARTITION; PARTIAL SCAN;
D O I：
10.1007/BF00993315
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
This paper describes an exact algorithm for the identification of a minimal feedback vertex set in digital circuits. The proposed algorithm makes use of graph reduction and efficient graph partitioning methods based on local properties of digital circuits. It has been implemented and applied to ISCAS-89 benchmark circuits. Previously, non-optimum solutions were found. In other cases, the optimality of the solution could not be established for all circuits. By using the proposed algorithm we obtained the optimum results for all the circuits in a relatively short CPU time.
引用
收藏
页码：71 / 81
页数：11
相关论文
共 50 条
12345