On computing the minimum feedback vertex set of a directed graph bycontraction operations

Finding the minimum feedback vertex set (MFVS) in a graph is an important problem for a variety of computer-aided design (CAD) applications and graph reduction plays an important role in solving this intractable problem. This paper is largely concerned with three new and powerful reduction operations. Each of these operations defines a new class of graphs, strictly larger than the class of contractible graphs [Levy and Low (1988)] in which the MFVS can be found in polynomial-time complexity. Based on these operations, an exact algorithm run on branch and bound manner is developed. This exact algorithm uses a good heuristic to find out an initial solution and a good bounding strategy to prune the solution space. To demonstrate the efficiency of our algorithms, we have implemented our algorithms and applied them to solving the partial scan problem in ISCAS'89 benchmarks. The experimental results show that if our three new contraction operations are applied, 27 out of 31 circuits in ISCAS'89 benchmarks can be fully reduced. Otherwise, only 12 out of 31 can be fully reduced. Furthermore, for all ISCAS'89 benchmarks our exact algorithm can find the exact cutsets in less than 3 s (CPU time) on a SUN-UltraII workstation. Therefore, the new contraction operations and our algorithms are demonstrated to be very effective in the partial scan application.

[1]  S.M. Reddy,et al.  On determining scan flip-flops in partial-scan designs , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[2]  Vishwani D. Agrawal,et al.  An exact algorithm for selecting partial scan flip-flops , 1994, 31st Design Automation Conference.

[3]  Reuven Bar-Yehuda,et al.  Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference , 1998, SIAM J. Comput..

[4]  Joseph Naor,et al.  Approximating Minimum Feedback Sets and Multicuts in Directed Graphs , 1998, Algorithmica.

[5]  Mary Lou Soffa,et al.  Feedback vertex sets and cyclically reducible graphs , 1985, JACM.

[6]  Mihalis Yannakakis,et al.  Node-Deletion Problems on Bipartite Graphs , 1981, SIAM J. Comput..

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[9]  Y. Daniel Liang.  On the Feedback Vertex Set Problem in Permutation Graphs , 1994, Inf. Process. Lett..

[10]  Chuan Yi Tang,et al.  A Linear-Time Algorithm for the Weighted Feedback Vertex Problem on Interval Graphs , 1997, Inf. Process. Lett..

[11]  Alberto L. Sangiovanni-Vincentelli,et al.  Multiple-Valued Minimization for PLA Optimization , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  Peter A. Beerel,et al.  Accelerating Markovian analysis of asynchronous systems using string-based state compression , 1998, Proceedings Fourth International Symposium on Advanced Research in Asynchronous Circuits and Systems.

[13]  K.-T. Cheng,et al.  A Partial Scan Method for Sequential Circuits with Feedback , 1990, IEEE Trans. Computers.

[14]  Daniel P. Siewiorek,et al.  Automated Synthesis of Data Paths in Digital Systems , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[15]  Kwang-Ting Cheng,et al.  Timing-driven partial scan , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[16]  Hanoch Levy,et al.  A Contraction Algorithm for Finding Small Cycle Cutsets , 1988, J. Algorithms.

[17]  Sharad Malik,et al.  Implicit Computation of Minimum-Cost Feedback-Vertex Sets for Partial Scan and Other Applications , 1994, 31st Design Automation Conference.

[18]  Graeme Smith,et al.  The identification of a minimal feedback vertex set of a directed graph , 1975 .

[19]  Spyros Tragoudas,et al.  Retiming-Based Partial Scan , 1996, IEEE Trans. Computers.

[20]  V.D. Agrawal,et al.  Designing circuits with partial scan , 1988, IEEE Design & Test of Computers.

[21]  Jing-Yang Jou,et al.  Power driven partial scan , 1997, Proceedings International Conference on Computer Design VLSI in Computers and Processors.