A comparison between two variations of a pebble game on graphs
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.
KeywordsInduction Hypothesis Directed Acyclic Graph Distinguished Vertex Main Lemma Efficient Simulation
Unable to display preview. Download preview PDF.
- 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
- J.R. Gilbert, R.E. Tarjan: Variations of a pebble game, preprint, Stanford, 1978.Google Scholar
- S. Cook, R. Sethi: Storage requirements for deterministic polynomial time recognizable languages, Journal Comp. and Syst. Sc. 13 (1976), 25–37.Google Scholar
- 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
- 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