SpringerLink
Log in

On time-space trade-offs in dynamic graph pebbling

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1993 (MFCS 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 711))

Abstract

Pebble game on dynamic graphs is studied as an abstract model for the incremental computations. We investigate how the time T and/or the space S is changing according to the number m of insert-edge/delete-edge operations on directed acyclic graphs of size n. Time-space trade-off of the form T= Θ (n 2/S+m) is given for standard pebble game on permutation graphs. In the case of the minimal space pebbling an extreme (superpolynomial) explosion of the time is related to the unit change of the graph size. If the space is from a small interval then a superpolynomial time increase is also achieved relative to the small (slowly increasing) change of the graph size.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Carlson, D.A. and Savage, J. E.: Extreme Time-Space Tradeoffs for Graphs with Small Space Requirements. IPL 14, 1982, pp. 223–227

    Google Scholar 

  2. Cook, S.A.: An Observation on Time-Storage Trade Off. JCSS 9, 1974, pp. 308–316

    Google Scholar 

  3. Lengauer, T. and Tarjan, R.E.: Asymptotically Tight Bounds on Time-Space Tradeoffs in a Pebble Game. JACM 29, 1982, pp. 1087–1130

    Google Scholar 

  4. Pippenger, N.: Pebbling. 5th IBM MFCS, Tokyo, 1980, p. 19

    Google Scholar 

  5. Venkateswaran, H. and Tompa, M.: A New Pebble Game that Characterizes Parallel Complexity Classes. SIAM J. Computing 18, 1989, pp. 533–549

    Google Scholar 

  6. Wilber, R.: White Pebbles Help. JCSS 36, 1988, pp. 108–124

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Comenius University, 842 15, Bratislava, Slovakia

    Peter Ružička & Juraj Waczulík

Authors
  1. Peter Ružička
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Juraj Waczulík
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej M. Borzyszkowski Stefan Sokołowski

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ružička, P., Waczulík, J. (1993). On time-space trade-offs in dynamic graph pebbling. In: Borzyszkowski, A.M., Sokołowski, S. (eds) Mathematical Foundations of Computer Science 1993. MFCS 1993. Lecture Notes in Computer Science, vol 711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57182-5_58

Download citation

  • DOI: https://doi.org/10.1007/3-540-57182-5_58

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57182-7

  • Online ISBN: 978-3-540-47927-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation