Title: An Algorithm for Finding the Reachability Matrix of a Directed Linear Graph
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.
Publication Year: 1969
Publication Date: 1969-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 2
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot