The Space Complexity of Two Pebbles Games on Trees
| dc.contributor.author | Loui, Michael C. | en_US |
| dc.date.accessioned | 2023-03-29T14:13:05Z | |
| dc.date.available | 2023-03-29T14:13:05Z | |
| dc.date.issued | 1979-05 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/148960 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-133 | |
| dc.title | The Space Complexity of Two Pebbles Games on Trees | en_US |
| dc.identifier.oclc | 5185369 |
