On the computational complexity of minimal cumulative cost graph pebbling (Q2656946)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of minimal cumulative cost graph pebbling |
scientific article |
Statements
On the computational complexity of minimal cumulative cost graph pebbling (English)
0 references
17 March 2021
0 references
