On the Determination of Minimum Feedback Arc and Vertex Sets
- 1 March 1968
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 15 (1), 86-89
- https://doi.org/10.1109/TCT.1968.1082764
Abstract
A method presented by Lempel and Cederbaum to find minimum feedback arc and vertex sets in directed graphs is shown to be partly equivalent to the well-known prime implicant problem of switching theory.Keywords
This publication has 9 references indexed in Scilit:
- Minimum Feedback Arc and Vertex Sets of a Directed GraphIEEE Transactions on Circuit Theory, 1966
- A Method for the Selection of Prime ImplicantsIEEE Transactions on Electronic Computers, 1966
- Implication techniques for Bollean functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1964
- A reduction technique for prime implicant tablesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1964
- Minimum Feedback Arc Sets for a Directed GraphIEEE Transactions on Circuit Theory, 1963
- The Reduction of Redundancy in Solving Prime Implicant TablesIRE Transactions on Electronic Computers, 1962
- Determination of the Irredundant Normal Forms of a Truth Function by Iterated Consensus of the Prime ImplicantsIEEE Transactions on Electronic Computers, 1960
- Irredundant Disjunctive and Conjunctive Forms of a Boolean FunctionIBM Journal of Research and Development, 1957
- Minimization of Boolean Functions*Bell System Technical Journal, 1956