Efficient determination of the transitive closure of a directed graph (Q2547483): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q29042360, #quickstatements; #temporary_batch_1711504539957 |
Created claim: DBLP publication ID (P1635): journals/ipl/Munro71, #quickstatements; #temporary_batch_1731508824982 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: A Theorem on Boolean Matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A transitive closure algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5616735 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Gaussian elimination is not optimal / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/ipl/Munro71 / rank | |||
Normal rank | |||
Latest revision as of 16:13, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient determination of the transitive closure of a directed graph |
scientific article |
Statements
Efficient determination of the transitive closure of a directed graph (English)
0 references
1971
0 references
