The Space Complexity of Two Pebbles Games on Trees

Author(s)
Loui, Michael C.
Thumbnail
DownloadMIT-LCS-TM-133.pdf (3.441Mb)
Metadata
Show full item record
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.
Date issued
1979-05
URI
https://hdl.handle.net/1721.1/148960
Series/Report no.
MIT-LCS-TM-133
Collections