The input/output complexity of transitive closure
- 1 May 1990
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 19 (2) , 44-53
- https://doi.org/10.1145/93597.93620
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Matrix multiplication via arithmetic progressionsPublished by Association for Computing Machinery (ACM) ,1987
- I/O complexityPublished by Association for Computing Machinery (ACM) ,1981
- A modification of Warshall's algorithm for the transitive closure of binary relationsCommunications of the ACM, 1975
- Algorithm 447: efficient algorithms for graph manipulationCommunications of the ACM, 1973
- Organizing matrices and matrix operations for paged memory systemsCommunications of the ACM, 1969
- A Theorem on Boolean MatricesJournal of the ACM, 1962