Paula Harder, Venkatesh Ramesh, et al.
EGU 2023
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
Conference paper
Learning Reduced Order Dynamics via Geometric Representations
Imran Nasim, Melanie Weber
SCML 2024
Susumu Horiguchi, Takeo Nakada
Journal of Parallel and Distributed Computing
Sebastian Hudert, Torsten Eymann, et al.
IEEE-CEC 2000