An algorithm for finding the transitive closure of a digraph (Q1225062): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An algorithm for finding the transitive closure of a digraph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4049111 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank | |||
Revision as of 18:30, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for finding the transitive closure of a digraph |
scientific article |
Statements
An algorithm for finding the transitive closure of a digraph (English)
0 references
1975
0 references
