Sciweavers

21 search results - page 3 / 5
» Pebbling and optimal pebbling in graphs
Sort
View
STOC
1993
ACM
109views Algorithms» more  STOC 1993»
13 years 11 months ago
Routing permutations on graphs via matchings
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...
Noga Alon, Fan R. K. Chung, Ronald L. Graham
JGAA
2010
82views more  JGAA 2010»
13 years 6 months ago
A Graph Pebbling Algorithm on Weighted Graphs
Nándor Sieben
STOC
1998
ACM
89views Algorithms» more  STOC 1998»
13 years 11 months ago
The Power of a Pebble: Exploring and Mapping Directed Graphs
Michael A. Bender, Antonio Fernández, Dana ...
GC
2002
Springer
13 years 7 months ago
A Note on Graph Pebbling
Andrzej Czygrinow, Glenn Hurlbert, Hal A. Kierstea...