Algorithmus 26 An algorithm for finding the transitive closure of a digraph
- 1 March 1975
- journal article
- Published by Springer Nature in Computing
- Vol. 15 (1) , 75-79
- https://doi.org/10.1007/bf02252839
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Algorithmus 26 An algorithm for finding the transitive closure of a digraphComputing, 1975
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972