On computing the time complexity of transitive closure algorithms (Q2561238): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(73)90010-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1974217322 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5617548 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On computing the time complexity of transitive closure algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5585020 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A transitive closure algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Theorem on Boolean Matrices / rank | |||
Normal rank | |||
Latest revision as of 13:04, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On computing the time complexity of transitive closure algorithms |
scientific article |
Statements
On computing the time complexity of transitive closure algorithms (English)
0 references
1973
0 references
