Pebbling and bandwidth
- 1 January 1981
- book chapter
- Published by Springer Nature
- p. 373-383
- https://doi.org/10.1007/3-540-10854-8_41
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A comparison of two variations of a pebble game on graphsTheoretical Computer Science, 1981
- Bandwidth constrained NP-Complete problemsPublished by Association for Computing Machinery (ACM) ,1981
- The Pebbling Problem is Complete in Polynomial SpaceSIAM Journal on Computing, 1980
- Move rules and trade-offs in the pebble gamePublished by Springer Nature ,1979
- On Time Versus SpaceJournal of the ACM, 1977
- Storage requirements for deterministic polynomialtime recognizable languagesJournal of Computer and System Sciences, 1976
- Complete Register Allocation ProblemsSIAM Journal on Computing, 1975