4 citations · 4 across the 1 of their papers we have counts for
1 paper · 1 filter
K. Milans, B. Clark
We explore the complexity of computing the optimal pebbling number and pebbling number of a graph. We show that deciding whether the optimal pebbling number of G is at most k is NP…