An improved algorithm for transitive closure on acyclic digraphs (Q1110330): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Mirko Křivánek / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Mirko Křivánek / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(88)90032-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2017139167 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3931215 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3338160 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4065548 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximate counting: a detailed analysis / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4195940 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3219752 / rank | |||
Normal rank | |||
Latest revision as of 19:24, 18 June 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
