By Topic

Computing minimum feedback vertex sets by contraction operations and its applications on CAD

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hen-Ming Lin ; Dept. of Electron. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan ; Jing-Yang Jou

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

Published in:

Computer Design, 1999. (ICCD '99) International Conference on

Date of Conference: