Ora Nova Fandina, Eitan Farchi, et al.
AAAI 2026
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
Guillaume Buthmann, Tomoya Sakai, et al.
ICASSP 2025
Berrin Yanikoglu, Peter A. Sandon
Pattern Recognition
Robert Farrell, Rajarshi Das, et al.
AAAI-SS 2010