A note on minimal essential sets
- 1 September 1971
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 18 (5) , 557-560
- https://doi.org/10.1109/tct.1971.1083332
Abstract
A completely topological algorithm for determining a minimal essential set (minimum feedback vertex set) of a linear oriented graph is presented. From a logical point of view, the algorithm is a modified version of the well-known McCluskey method for the prime implicant problem of switching theory. From a computational point of view, it avoids the need of the covering table, i.e., the need of generating the set of the elementary circuits of the graph.Keywords
This publication has 3 references indexed in Scilit:
- On the Determination of Minimum Feedback Arc and Vertex SetsIEEE Transactions on Circuit Theory, 1968
- Generation of all Hamiltonian Circuits, Paths, and Centers of a Graph, and Related ProblemsIEEE Transactions on Circuit Theory, 1967
- Minimum Feedback Arc and Vertex Sets of a Directed GraphIEEE Transactions on Circuit Theory, 1966