Pebbling and bandwidth

  • Ivan Hal Sudborough
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 117)


It is shown that a graph with n vertices and bandwidth k requires at most min(2k2+k+1,2klogn) pebbles. Furthermore, the pebble problem restricted to and/or graphs of bandwidth f(n) is in INSPACE( f(n)×log2n) and is log space hard for the class INTISP(poly,f(n)). ( INTISP(poly,f(n)) denotes the class of sets accepted by nondeterministic Turing machines in polynomial time and simultaneous f(n) space. )


Turing Machine Recursive Call Truth Assignment Springer Lecture Note Algorithm Place 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M-J Chung, W.M. Evangelist, and I.H. Sudborough, Some additional examples of bandwidth constrained NP-complete problems, Proc. 15th Conf. on Info. Sciences and Systems (1981), The Johns Hopkins University, Baltimore, Md., U.S.A., to appear.Google Scholar
  2. 2.
    S.A. Cook, An observation on time-storage trade-off, J. Comput. System Sci. (1974), pp. 308–316.Google Scholar
  3. 3.
    S.A. Cook and R. Sethi, Storage requirements for determinstic polynomial time recognizable languages, J. Comput. System Sci. 13 (1976), pp. 25–37.Google Scholar
  4. 4.
    P. van Emde Boas and J. van Leeuwen, Move rules and trade-offs in the pebble game, Proc. 4th GI Conf., Springer Lecture Notes in Computer Sci. 67 (1979), pp. 101–112.Google Scholar
  5. 5.
    J.R. Gilbert, T. Lengauer, and R.E. Tarjan, The pebbling problem is complete in polynomial space, SIAM J. Comput. 9,3 (1980), pp. 513–524.Google Scholar
  6. 6.
    J.E. Hopcroft, W. Paul, and L. Valiant, On time versus space, J. Assoc. Comput. Mach. 24 (1977), pp. 332–337.Google Scholar
  7. 7.
    T. Lengauer and R.E. Tarjan, The space complexity of pebble games on trees, Preprint, Stanford University (1979).Google Scholar
  8. 8.
    A. Lingas, A PSPACE complete problem related to a pebble game, Proc. 1978 ICALP, Springer Lecture Notes in Computer Sci. 62, pp. 300–321.Google Scholar
  9. 9.
    M.C. Loui, The space complexity of two pebble games on trees, TM-133, Laboratory for Computer Sci., Massachusetts Inst. of Technology, Cambridge, Mass., U.S.A. (1979)Google Scholar
  10. 10.
    F. Meyer auf der Heide, A comparison of two variations of a pebble game on graphs, Theoretical Computer Sci. 13 (1981), pp. 315–322.Google Scholar
  11. 11.
    B. Monien and I.H. Sudborough, On eliminating nondeterminism from Turing machines which use less than logarithm worktape space, Proc. 1979 ICALP, Springer Lecture Notes in Computer Sci. 72, pp. 431–445.Google Scholar
  12. 12.
    B. Monien and I.H. Sudborough, Bandwidth constrained NP-complete problems, Proc. 13th Annual ACM Theory of Computing Symp. (1981), to appear.Google Scholar
  13. 13.
    M.S. Paterson and C.E. Hewitt, Comparative schematology, Record of Project MAC Conf. on Concurrent Systems and Parallel Computation, Cambridge, MA, U.S.A., pp. 119–128.Google Scholar
  14. 14.
    R. Sethi, Complete register allocation problems, SIAM J. Comput. 4 (1975), pp. 226–48.Google Scholar
  15. 15.
    I.H. Sudborough, Efficient algorithms for path system problems and applications to alternating and time-space complexity classes, Proc. 21st Annual Symp. on Foundations of Computer Sci. (1980), IEEE Computer Society, Long Beach, Calif., pp. 62–73.Google Scholar
  16. 16.
    P.H. Winston, Artificial Intelligence, Addison-Wesley Publishers (1977).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Ivan Hal Sudborough
    • 1
  1. 1.Department of Electrical Engineering and Computer ScienceNorthwestern UniversityEvanstonUSA

Personalised recommendations