Title :
A note on minimal and quasi-minimal essential sets in complex directed graphs
Author :
Diaz, M. ; Richard, Joyce ; Courvoisier, M.
fDate :
9/1/1972 12:00:00 AM
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 :
Graph theory; Network topology; Absorption; Circuits;
Journal_Title :
Circuit Theory, IEEE Transactions on
DOI :
10.1109/TCT.1972.1083540
