An indirect method for minimal essential sets
- 1 January 1974
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems
- Vol. 21 (1) , 14-17
- https://doi.org/10.1109/tcs.1974.1083809
Abstract
Further results on minimal essential sets in directed graphs are presented and an indirect algorithm based on the analysis of the complementary graph is derived.Keywords
This publication has 6 references indexed in Scilit:
- A note on minimal and quasi-minimal essential sets in complex directed graphsIEEE Transactions on Circuit Theory, 1972
- A note on minimal essential setsIEEE Transactions on Circuit Theory, 1971
- 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
- A note on the derivation of maximal compatibility classesCalcolo, 1966