The Complexity of Pebbling and Cover Pebbling

Details The Complexity of Pebbling and Cover Pebbling The Complexity of Pebbling and Cover Pebbling

2005-03-24

arxiv.org/abs/math/0503511v3

Mathematics

Combinatorics

20 pages, 3 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Complexity of Pebbling and Cover 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 Pebbling and Cover Pebbling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Complexity of Pebbling and Cover Pebbling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-586862