Title :
An indirect method for minimal essential sets
fDate :
1/1/1974 12:00:00 AM
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 :
Graph theory; Graph theory and network topology; Algorithm design and analysis; Circuits; Helium; Inspection; Terminology;
Journal_Title :
Circuits and Systems, IEEE Transactions on
DOI :
10.1109/TCS.1974.1083809
