A note on minimal and quasi-minimal essential sets in complex directed graphs
- 1 September 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 19 (5) , 512-513
- https://doi.org/10.1109/TCT.1972.1083540
Abstract
This work deals with the problem of finding minimal or quasi-minimal essential sets in directed graphs. Mainly based on a topological approach recently suggested, a modified algorithm for minimal essential sets is pointed out, and a new algorithm is proposed for quasi-minimal essential sets.Keywords
This publication has 3 references indexed in Scilit:
- 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
- Minimum Feedback Arc and Vertex Sets of a Directed GraphIEEE Transactions on Circuit Theory, 1966