On the computational complexity of minimal cumulative cost graph pebbling (Q2656946)
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 minimal cumulative cost graph pebbling |
scientific article; zbMATH DE number 7323903
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of minimal cumulative cost graph pebbling |
scientific article; zbMATH DE number 7323903 |
Statements
On the computational complexity of minimal cumulative cost graph pebbling (English)
0 references
17 March 2021
0 references
0.8320003747940063
0 references
0.7993084192276001
0 references
0.7711904644966125
0 references
0.7697849869728088
0 references
0.7636886835098267
0 references
