Computing Minimum Feedback Vertex Sets by Contraction Operations and its Applications on CAD

@inproceedings{Lin1999ComputingMF,
  title={Computing Minimum Feedback Vertex Sets by Contraction Operations and its Applications on CAD},
  author={Hen-Ming Lin and Jing-Yang Jou},
  booktitle={ICCD},
  year={1999}
}
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, strictly larger than the class of contractible graphs, in which the MFVS can be found in polynomial-time complexity. Based on these operations, an exact algorithm… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-8 of 8 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 12 references

A Contraction Algorithm for Finding Small Cycle Cutsets

J. Algorithms • 1988
View 6 Excerpts
Highly Influenced

The Identification of a Minimal Feedback Vertex Set of a Directed Graph

G. W. Smith, R. B. Walford
IEEE Trans. on Circuits and System , Vol. CAS-22, No. 1, pp. 9-14, 1975. • 1975
View 2 Excerpts
Highly Influenced

Multiple-Valued Minimization for PLA Optimization

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems • 1987
View 2 Excerpts

Automated Synthesis of Data Paths in Digital Systems

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems • 1986
View 2 Excerpts

Similar Papers

Loading similar papers…