223 search results - page 2 / 45 » A Note on Graph Pebbling |
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...
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...
STOC
1993
ACM
15 years 2 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
JGAA
2010
14 years 8 months ago
2010
JIS
2008
14 years 9 months ago
2008
Some developments in the information science discipline over a period of thirty years are discussed, by selecting topics covered in the early issues of Journal of Information Scie...