An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs (Q1075771): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:06, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs |
scientific article |
Statements
An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs (English)
0 references
1986
0 references
list processing
0 references
data structures
0 references
graph algorithms
0 references
directed graph
0 references
circuit-free graph
0 references
