An improved algorithm for transitive closure on acyclic digraphs
Open Access
- 1 June 1988
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 58 (1-3) , 325-346
- https://doi.org/10.1016/0304-3975(88)90032-1
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Approximate counting: A detailed analysisBIT Numerical Mathematics, 1985
- On expected costs of deadlock detectionInformation Processing Letters, 1980
- An Algorithm for Transitive Closure with Linear Expected TimeSIAM Journal on Computing, 1978