The complexity of growing a graph (Q6112002): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:19, 10 July 2024
scientific article; zbMATH DE number 7722896
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of growing a graph |
scientific article; zbMATH DE number 7722896 |
Statements
The complexity of growing a graph (English)
0 references
4 August 2023
0 references
temporal graph
0 references
cop-win graph
0 references
graph process
0 references
polynomial-time algorithm
0 references
lower bound
0 references
NP-complete
0 references
hardness result
0 references
