Mathematics – Combinatorics
Scientific paper
2005-03-24
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.
No associations
LandOfFree
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.
Profile ID: LFWR-SCP-O-586862