Graph Pebbling with Many Free Pebbles can be Difficult

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.

Authors

David A. Carlson

This author has not been identified. Look up 'David A. Carlson' in Google

John E. Savage

This author has not been identified. Look up 'John E. Savage' in Google