The Complexity of Graph Pebbling (Q5757392)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5188078
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Complexity of Graph Pebbling |
scientific article; zbMATH DE number 5188078 |
Statements
The Complexity of Graph Pebbling (English)
0 references
6 September 2007
0 references
graph pebbling
0 references
complexity
0 references
\({\Pi_2^{\mathrm{p}}}\)-completeness
0 references
0.93306714
0 references
0.9285934
0 references
0.92684823
0 references
0 references
0.91523796
0 references
0.9058564
0 references
