An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs (Q1075771)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs |
scientific article; zbMATH DE number 3952029
| 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; zbMATH DE number 3952029 |
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
0 references
