Advertisement

A comparison between two variations of a pebble game on graphs

  • Friedhelm Meyer auf der Heide
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 71)

Abstract

We study the relation between the number of pebbles used in the black and the black-white pebble game and show that the additional use of white pebbles cannot save more than a square-root and give an example in which it does save a factor 1/2.

Keywords

Induction Hypothesis Directed Acyclic Graph Distinguished Vertex Main Lemma Efficient Simulation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    W. Paul, R.E. Tarjan, J.R. Celoni: Space bounds for a game on graphs, Math. Systems Theory 10 (1976/77), 239–251.Google Scholar
  2. [2]
    J.R. Gilbert, R.E. Tarjan: Variations of a pebble game, preprint, Stanford, 1978.Google Scholar
  3. [3]
    S. Cook, R. Sethi: Storage requirements for deterministic polynomial time recognizable languages, Journal Comp. and Syst. Sc. 13 (1976), 25–37.Google Scholar
  4. [4]
    S. Cook: An observation on time-storage trade off, Proceedings of the Fifth Annual ACM Symp. on Theory of Computing (1973), 29–33.Google Scholar
  5. [5]
    J. Hopcroft, W. Paul, L. Valiant: On time versus space and related problems, Sixteenth Annual Symposium on Foundations of Computer Science (1975), 57–64.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Friedhelm Meyer auf der Heide
    • 1
  1. 1.Faculty of mathematicsUniversity of BielefeldW-Germany

Personalised recommendations