Publication
Journal of the ACM
Paper

A Tight Bound for Black and White Pebbles on the Pyramid

Download paper

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.

Date

Publication

Journal of the ACM

Authors

Topics

Resources

Share