An algorithm for finding the transitive closure of a digraph (Q1225062): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02252839 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W423069184 / rank | |||
Normal rank |
Latest revision as of 10:01, 30 July 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