Tushar Deepak Chandra, Sam Toueg
Journal of the ACM
Lengauer and Tarjan proved that the number of black and white pebbles needed to pebble the root of a tree is at least half the number of black pebbles needed to pebble the root. This result is extended to a larger class of acyclic directed graphs including pyramid graphs. © 1985, ACM. All rights reserved.
Tushar Deepak Chandra, Sam Toueg
Journal of the ACM
L. Joskowicz, Elisha Sacks
aaai 1994
Matthew Arnold, David Piorkowski, et al.
IBM J. Res. Dev
Yale Song, Zhen Wen, et al.
IJCAI 2013