Mustansar Fiaz, Mubashir Noman, et al.
IGARSS 2025
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
L. Joskowicz, Elisha Sacks
aaai 1994
Conference paper
Predicting knowledge in an ontology stream
Freddy Lécué, Jeff Z. Pan
IJCAI 2013
Hironori Takeuchi, Tetsuya Nasukawa, et al.
Transactions of the Japanese Society for Artificial Intelligence