Modified linear programming and class 0 bounds for graph pebbling (Q2410032)
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 6791739
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Modified linear programming and class 0 bounds for graph pebbling |
scientific article; zbMATH DE number 6791739 |
Statements
Modified linear programming and class 0 bounds for graph pebbling (English)
0 references
17 October 2017
0 references
pebbling
0 references
class 0
0 references
linear programming
0 references
Lemke
0 references
0.8589636087417603
0 references
0.8296793699264526
0 references
0.8216162919998169
0 references
0.8206906914710999
0 references
0.8125255107879639
0 references
