A note on minimal and quasi-minimal essential sets in complex directed graphs
María Isabel Bermejo Díaz, Jean‐Philippe P. Richard, M. Courvoisier · IEEE Transactions on Circuit Theory · 1972
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.