Restricted optimal pebbling is NP-hard (Q6611025)
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: Restricted optimal pebbling is NP-hard |
scientific article; zbMATH DE number 7919030
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Restricted optimal pebbling is NP-hard |
scientific article; zbMATH DE number 7919030 |
Statements
Restricted optimal pebbling is NP-hard (English)
0 references
26 September 2024
0 references
restricted optimal pebbling
0 references
optimal pebbling
0 references
graph pebbling
0 references