Acta Informatica

, Volume 16, Issue 4, pp 465–475 | Cite as

Black-white pebbles and graph separation

  • Thomas Lengauer


We exhibit a close relationship between two topics in computational complexity. One topic is the analysis of storage requirements for nondeterministic computations. The corresponding mathematical model is a well known black-white pebble game on directed acyclic graphs. The other topic is the search for small separators of undirected graphs. We model a dynamic version of the concept of a separator with a vertex separator game. This game is closely related to graph layout and searching problems. We show that instances of the black-white pebble game and the vertex separator game can easily be transformed into each other. As an application of this result both games are shown to be NP-complete.


Mathematical Model Information System Operating System Data Structure Communication Network 
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.
    Cook, S.A., Sethi, R.: Storage requirements for deterministic polynomial finite recognizable languages. JCSS 13, 25–37 (1976)Google Scholar
  2. 2.
    Gavril, F.: Some NP-complete problems on graphs. Proc. 11th Conf. on Information Sciences and Systems, John Hopkins University, Baltimore, MD (1977), 91–95Google Scholar
  3. 3.
    Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA (1979)Google Scholar
  4. 4.
    Garey, M.R., Johnson, D.S., Papadimitriou, C.: Private communicationGoogle Scholar
  5. 5.
    Gilbert, J.R., Lengauer, T., Tarjan, R.E.: The pebbling problem is complete in polynomial space. SIAM J. Comp. 9, 513–525 (1980)Google Scholar
  6. 6.
    Leiserson, C.E.: Area-efficient graph layouts (for VLSI). 21st Annual IEEE-FOCS (1980), 270–281Google Scholar
  7. 7.
    Lengauer, T.: Upper and lower bounds for time-space tradeoffs in a pebble game. Technical Report STAN-CS-79-745, Stanford University, Stanford, CA 94305 (1979)Google Scholar
  8. 8.
    Lengauer, T.: Upper and lower bounds on the complexity of the min-cut linear arrangement problem on trees. Technical Report, Bell Laboratories, Murray Hill, N.J. 07974 (1980). (To appear in SIAM Journal of Algebraic and Discrete Methods)Google Scholar
  9. 9.
    Lengauer, T., Tarjan, R.E.: The space complexity of pebble games on trees. Inf. Proc. Let. 10, 184–188 (1980)Google Scholar
  10. 10.
    Lipton, R.J., Tarjan, R.E.: A planar separator theorem. SIAM J. Appl. Math. 36, 177–189 (1977)Google Scholar
  11. 11.
    Loui, M.C.: The space complexity of two pebble games on trees. LCS Report No. 133, M.I.T., Cambridge, Mass (1979)Google Scholar
  12. 12.
    Meyer auf der Heide, F.: A comparison between two variations of a pebble game on graphs. University of Bielefeld, Bielefeld, West-Germany (1978)Google Scholar
  13. 13.
    Pippenger, N.: Pebbling. Proc. of the 5th IBM Symposium on Math. Foundations of Comp. Sci., Hakona, Japan (1980)Google Scholar
  14. 14.
    Philipp, R., Prauss, E.: Über Separatoren in planaren Graphen. ACTA Informatica 14, 87–97 (1980)Google Scholar
  15. 15.
    Sethi, R.: Complete register allocation problems. SIAM J. Comp. 4, 226–248 (1975)Google Scholar

Copyright information

© Springer-Verlag 1981

Authors and Affiliations

  • Thomas Lengauer
    • 1
  1. 1.Bell LaboratoriesMurray HillUSA

Personalised recommendations