We are experiencing some difficulties with our submission forms, which we are working to resolve. If you have any issues, please contact us at dspace-lib@mit.edu.

The Space Complexity of Two Pebbles Games on Trees

Thumbnail Image
Download
Name

MIT-LCS-TM-133.pdf

Size

3.44 MB

Format

Adobe PDF

Checksum (MD5)

f3e62ea800995a97f15e05f23f279a25

Author(s)
Loui, Michael C.
Date Issued
May 1979
Series/Report no.
MIT-LCS-TM-133
Abstract
In the standard pebble game the number of pebbles required to pebble the root of a tree can be computed in time linearly proportional to the number of nodes. For the black/white pebble game the number of pebbles necessary to pebble the root of a complete tree is derived.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.