DocumentCode
1170980
Title
A note on minimal and quasi-minimal essential sets in complex directed graphs
Author
Diaz, M. ; Richard, Joyce ; Courvoisier, M.
Volume
19
Issue
5
fYear
1972
fDate
9/1/1972 12:00:00 AM
Firstpage
512
Lastpage
513
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;
fLanguage
English
Journal_Title
Circuit Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9324
Type
jour
DOI
10.1109/TCT.1972.1083540
Filename
1083540
Link To Document