The Space Complexity of Pebble Games on Trees

  title={The Space Complexity of Pebble Games on Trees},
  author={Thomas Lengauer and Robert E. Tarjan},
  journal={Inf. Process. Lett.},
tudy two different pebble games that are yed on directed ‘acyclic graphs. One game uses ek pebbles only. We call this game the black pebble ot me WCS black and white pebbles 1 it lack & white pebble game. Both have b,een studied in the past. For results on the ck pebble game see [I ,S,G,150]. For results on the ck &, white pebble game se% 12,4,7-91. The black pebble game is played according to the f~~~al~ing rules: (i) a pebble may be removed from a vertex at any time; (ii) if all predecessors… CONTINUE READING
Highly Cited
This paper has 37 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 18 extracted citations


Publications referenced by this paper.
Showing 1-9 of 9 references

The space complexity of two pebble games on trees, Laboratory of Computer Science

  • M. C. Loui
  • Technical Report No. 133,
  • 1979

Upper and lower bounds on timespace tradeoffs in a pebble game

  • T. Lengauer
  • Computer Science Report No. 745,
  • 1979

Variations of a pebble game on graphs

  • J. R. Gilbert, R. E. Tarjan
  • Computer Science Report No. 661,
  • 1978

Celoni, Space bounds for a game on

  • W. J. Paul, J.R.R.E. Tarjan
  • graphs, Math. Systems Theory
  • 1977

Similar Papers

Loading similar papers…