On the computational complexity of graph closures (Q1351617)
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: On the computational complexity of graph closures |
scientific article; zbMATH DE number 984458
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of graph closures |
scientific article; zbMATH DE number 984458 |
Statements
On the computational complexity of graph closures (English)
0 references
27 February 1997
0 references
Computational complexity
0 references
Graph closure
0 references
Parallel complexity
0 references
P-completeness
0 references
0 references
0 references
0 references
0.9090399
0 references
0.9013548
0 references
