David A. Carlson, John E. Savage. Graph Pebbling with Many Free Pebbles can be Difficult. In Conference Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, 28-30 April, Los Angeles, California, USA. pages 326-332, ACM, 1980.
@inproceedings{CarlsonS80,
title = {Graph Pebbling with Many Free Pebbles can be Difficult},
author = {David A. Carlson and John E. Savage},
year = {1980},
tags = {graph-rewriting, e-science, rewriting},
researchr = {https://researchr.org/publication/CarlsonS80},
cites = {0},
citedby = {0},
pages = {326-332},
booktitle = {Conference Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, 28-30 April, Los Angeles, California, USA},
publisher = {ACM},
}