An improved algorithm for transitive closure on acyclic digraphs (Q1110330): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q1071506 |
||
| Property / reviewed by | |||
| Property / reviewed by: Mirko Křivánek / rank | |||
Revision as of 11:44, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved algorithm for transitive closure on acyclic digraphs |
scientific article |
Statements
An improved algorithm for transitive closure on acyclic digraphs (English)
0 references
1988
0 references
The author improves the time and space complexity worst-case bounds of \textit{A. Goralčíková} and \textit{V. Koubek}'s algorithm for transitive closure of acyclic digraphs [Lect. Notes Comput. Sci. 74, 301- 307 (1979; Zbl 0408.68038)]. Further, some expected complexity bounds are derived in a model of random acyclic digraphs.
0 references
time and space complexity
0 references
transitive closure
0 references
random acyclic digraphs
0 references
