Sciweavers

JGT
2006
48views more  JGT 2006»
14 years 16 days ago
Maximum pebbling number of graphs of diameter three
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...
Boris Bukh
JGT
2008
59views more  JGT 2008»
14 years 16 days ago
Pebbling and optimal pebbling in graphs
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...
David P. Bunde, Erin W. Chambers, Daniel W. Cranst...
DM
2008
55views more  DM 2008»
14 years 19 days ago
Improved pebbling bounds
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...
Melody Chan, Anant P. Godbole
DM
2008
49views more  DM 2008»
14 years 19 days ago
Periodical states and marching groups in a closed owari
Owari is an old African game that consists of cyclically ordered pits that are filled with pebbles. In a sowing move all the pebbles are taken out of one pit and distributed one b...
Henning Bruhn
FCT
2007
Springer
14 years 6 months ago
Complexity of Pebble Tree-Walking Automata
We consider tree-walking automata using k pebbles. The pebbles are either strong (can be lifted from anywhere) or weak (can be lifted only when the automaton is on it). For each k,...
Mathias Samuelides, Luc Segoufin