An improved algorithm for transitive closure on acyclic digraphs (Q1110330)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An improved algorithm for transitive closure on acyclic digraphs |
scientific article; zbMATH DE number 4072380
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved algorithm for transitive closure on acyclic digraphs |
scientific article; zbMATH DE number 4072380 |
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
0 references
0.8844303
0 references
0.88293004
0 references
0.8829158
0 references
0.8829158
0 references
