On computing the transitive closure of a relation (Q1235010): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5616735 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5616737 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Top-down syntax nalysis / 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: Computational experiences with some transitive closure algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Theorem on Boolean Matrices / rank | |||
Normal rank |
Latest revision as of 20:48, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On computing the transitive closure of a relation |
scientific article |
Statements
On computing the transitive closure of a relation (English)
0 references
1977
0 references