✦ LIBER ✦

Searching and pebbling

✍ Scribed by Lefteris M. Kirousis; Christos H. Papadimitriou

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 937 KB
Volume: 47
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(86)90146-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pebbling and optimal pebbling in graphs

✍ David P. Bunde; Erin W. Chambers; Daniel Cranston; Kevin Milans; Douglas B. West 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 248 KB

## Abstract 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 the least __k__ such that for every distribution of __k__ pebbles and every vertex __r__, a p

Pebbling graphs

✍ David Moews 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 463 KB

Geometrical optics and chessboard pebbli

Geometrical optics and chessboard pebbling

✍ C. Knessl 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 461 KB

## Recently Chung. Graham, Morrison and Odlyzko [l] studied some combinatorial and asymptotic enumeration aspects of chessboard pebbling. In this problem, we start with a single pebble, placed at the origin (0,O) of an infinite chessboard. At each step we remove a pebble from (i,j) and repIace i

On the Pebbling Threshold Spectrum

✍ Glenn Hurlbert 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 278 KB

A Leaf and Pebble

✍ Monroe, Andrew 📂 Fiction 📅 2019 🌐 English ⚖ 241 KB 👁 2 views

In a world of elemental magic and Learner Skill, two friends narrowly avoid death while attending the school under the mountain. As they are forced to flee before finishing their studies, they must figure out how to stay alive, or fight back.

The pebbling number of C5 × C5

✍ David S. Herscovici; Aparna W. Higgins 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 519 KB

Chung has defined a pebbling move on a graph G to be the removal of two pebbles from one vertex and the addition of one pebble to an adjacent vertex. The pebbling number f(G) of a connected graph is the least number of pebbles such that any distribution of f(G) pebbles on G allows one pebble to be m