Mixed-approach algorithms for transitive closure (extended abstract)
- 1 April 1991
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 199-205
- https://doi.org/10.1145/113413.113431
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Finding paths and deleting edges in directed acyclic graphsInformation Processing Letters, 1988
- Matrix multiplication via arithmetic progressionsPublished by Association for Computing Machinery (ACM) ,1987
- An improved transitive closure algorithmComputing, 1983
- A reduct-and-closure algorithm for graphsLecture Notes in Computer Science, 1979
- An Algorithm for Transitive Closure with Linear Expected TimeSIAM Journal on Computing, 1978
- A modification of Warshall's algorithm for the transitive closure of binary relationsCommunications of the ACM, 1975
- Algorithmus 26 An algorithm for finding the transitive closure of a digraphComputing, 1975
- Efficient determination of the transitive closure of a directed graphInformation Processing Letters, 1971
- A transitive closure algorithmBIT Numerical Mathematics, 1970
- A Theorem on Boolean MatricesJournal of the ACM, 1962