The Complexity of Graph Pebbling

Details The Complexity of Graph Pebbling The Complexity of Graph Pebbling

2005-03-30

arxiv.org/abs/math/0503698v1

Mathematics

Combinatorics

24 pages, 6 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Complexity of Graph Pebbling does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Complexity of Graph Pebbling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Complexity of Graph Pebbling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-439352