Title :
An Algorithm for Finding the Reachability Matrix of a Directed Linear Graph
Author :
Unger, Sebastian
fDate :
2/1/1969 12:00:00 AM
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;
Journal_Title :
Circuit Theory, IEEE Transactions on
DOI :
10.1109/TCT.1969.1082889
