An indirect method for minimal essential sets

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.

Saved in:
Bibliographic Details
Published inIEEE transactions on circuits and systems Vol. 21; no. 1; pp. 14 - 17
Main Author Guardabassi, G.
Format Journal Article
LanguageEnglish
Published IEEE 01.01.1974
Subjects
Algorithm design and analysis
Circuits
Inspection
Terminology
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0098-4094
1558-1276
DOI:10.1109/TCS.1974.1083809