21 search results - page 1 / 5 » Pebbling and optimal pebbling in graphs |
65
Voted
JGT
2008
14 years 10 months ago
2008
Given a distribution of pebbles on the vertices of a graph G, a pebbling move takes two pebbles from one vertex and puts one on a neighboring vertex. The pebbling number (G) is th...
DM
2008
14 years 10 months ago
2008
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing o...
73
Voted
JGT
2006
14 years 10 months ago
2006
Given a configuration of pebbles on the vertices of a graph G, a pebbling move consists of taking two pebbles off some vertex v and putting one of them back on a vertex adjacent t...
107
click to vote
PODS
2001
ACM
15 years 10 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
85
Voted
ALGORITHMICA
2010
14 years 9 months ago
2010
We consider a graph with n vertices, and p < n pebbles of m colors. A pebble move consists of transferring a pebble from its current host vertex to an adjacent unoccupied verte...