REVIEW 3 cited by
The Complexity of Pebbling and Cover Pebbling
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
This paper discusses the complexity of graph pebbling, dealing with both traditional pebbling and the recently introduced game of cover pebbling. Determining whether a configuration is solvable according to either the traditional definition or the cover pebbling definition is shown to be NP-complete. The problem of determining the cover pebbling number for an arbitrary demand configuration is shown to be NP-hard.
Forward citations
Cited by 3 Pith papers
-
The only Class 0 Flower snark is the smallest
J_3, the smallest Flower snark, is Class 0 with pebbling number 12, making it the only Class 0 Flower snark.
-
A Weight Function Lemma Heuristic for Graph Pebbling
A new heuristic for building Weight Function Lemma strategies improves the best-known pebbling-number upper bounds for Blanuša 2 (30 vs 34) and Flower snarks Jm for m ≥ 5.
-
Applying Hurlbert's Linear Optimization Technique to Establish Bounds on Pebbling Numbers
The paper re-derives known pebbling number bounds for the Petersen graph, the Bruhat graph B4, and trees using Hurlbert's linear optimization technique with hand-chosen weight functions, without introducing new results.
Discussion (0). Continue with ORCID to comment.