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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(86)90021-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2038086027 / rank | |||
Normal rank | |||
Revision as of 23:29, 19 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
