The Complexity of Graph Pebbling
Combinatorics
2007-05-23 v1
Abstract
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-complete and deciding whether the pebbling number of G is at most k is \Pi_2-complete. Additionally, we provide a characterization of when an unordered set of pebbling moves can be ordered to form a valid sequence of pebbling moves.
Keywords
Cite
@article{arxiv.math/0503698,
title = {The Complexity of Graph Pebbling},
author = {K. Milans and B. Clark},
journal= {arXiv preprint arXiv:math/0503698},
year = {2007}
}
Comments
24 pages, 6 figures