Daniel Karl I. Weidele, Hendrik Strobelt, et al.
SysML 2019
Paper
A Tight Bound for Black and White Pebbles on the Pyramid
Abstract
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.
Related
Shuang Chen, Herbert Freeman
International Journal of Pattern Recognition and Artificial Intelligence
Arthur Nádas
IEEE Transactions on Neural Networks
Aamod Khatiwada, Harsha Kokel, et al.
NeurIPS 2024