Computational experiences with some transitive closure algorithms
- 1 March 1975
- journal article
- Published by Springer Nature in Computing
- Vol. 15 (1) , 33-39
- https://doi.org/10.1007/bf02252834
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Algorithmus 26 An algorithm for finding the transitive closure of a digraphComputing, 1975
- A fast expected time algorithm for Boolean matrix multiplication and transitive closureInformation and Control, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- The Transitive Reduction of a Directed GraphSIAM Journal on Computing, 1972
- Boolean matrix multiplication and transitive closurePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1971
- Efficient determination of the transitive closure of a directed graphInformation Processing Letters, 1971
- A transitive closure algorithmBIT Numerical Mathematics, 1970
- An algorithm for computing all paths in a graphBIT Numerical Mathematics, 1966
- Algorithm 96: AncestorCommunications of the ACM, 1962
- A Theorem on Boolean MatricesJournal of the ACM, 1962