DocumentCode
1164720
Title
An Algorithm for Finding the Reachability Matrix of a Directed Linear Graph
Author
Unger, Sebastian
Volume
16
Issue
1
fYear
1969
fDate
2/1/1969 12:00:00 AM
Firstpage
130
Lastpage
132
Abstract
A new algorithm is presented for finding all of the descendants of each node of an arbitrary directed linear graph. The validity of the algorithm is established and it is compared with a previously known algorithm and found to be faster for at least one class of implementations.
Keywords
Directed linear graphs; Graph theory; Matrix converters; Testing;
fLanguage
English
Journal_Title
Circuit Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9324
Type
jour
DOI
10.1109/TCT.1969.1082889
Filename
1082889
Link To Document