On computing the transitive closure of a relation
- 1 October 1977
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 8 (4) , 303-314
- https://doi.org/10.1007/bf00271339
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Computational experiences with some transitive closure algorithmsComputing, 1975
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Top-down syntax analysisActa Informatica, 1971
- A transitive closure algorithmBIT Numerical Mathematics, 1970
- A Theorem on Boolean MatricesJournal of the ACM, 1962