Abstract
Finding the minimum feedback vertex set (MFVS) in a graph is an important problem for a variety of 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 which is strictly larger than the class of contractible graphs, in which the MFVS can be found with polynomial-time complexity. Based on these operations, an exact algorithm run in a branch-and-bound manner is developed. This exact algorithm uses a good heuristic to find an initial solution and a good bounding strategy to prune the solution space. We have implemented our algorithms and applied them to solving the partial scan problem in the ISCAS89 benchmarks. Experimental results show that, for all ISCAS89 benchmarks, our exact algorithm can find the exact cutsets in less than three seconds of CPU time on a Sun Ultra II workstation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
