An improved algorithm for transitive closure on acyclic digraphs
- 1 January 1986
- book chapter
- Published by Springer Nature
- p. 376-386
- https://doi.org/10.1007/3-540-16761-7_87
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Approximate counting: A detailed analysisBIT Numerical Mathematics, 1985
- NP-CompletenessPublished by Springer Nature ,1984
- On expected costs of deadlock detectionInformation Processing Letters, 1980
- A reduct-and-closure algorithm for graphsLecture Notes in Computer Science, 1979