The complexity of pebbling in diameter two graphs (Q4899034)
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: The complexity of pebbling in diameter two graphs |
scientific article; zbMATH DE number 6121998
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of pebbling in diameter two graphs |
scientific article; zbMATH DE number 6121998 |
Statements
The Complexity of Pebbling in Diameter Two Graphs (English)
0 references
4 January 2013
0 references
graph pebbling
0 references
diameter two
0 references
NP-complete
0 references
0.909055233001709
0 references
0.9004881381988525
0 references
0.86508709192276
0 references
0.8634676337242126
0 references
0.8581898212432861
0 references
