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
Sebastian Hudert, Torsten Eymann, et al.
IEEE-CEC 2000
Conference paper
Automated Answer Validation using Text Similarity
Balaji Ganesan, Arjun Ravikumar, et al.
ICON 2023
Tushar Deepak Chandra, Sam Toueg
Journal of the ACM