DocumentCode
2182280
Title
A tight bound for black and white pebbles on the pyramid
Author
Klawe, Maria M.
fYear
1983
fDate
7-9 Nov. 1983
Firstpage
410
Lastpage
419
Abstract
Lengauer and Tarjan proved that the number of black and white pebbles needed to pebble the root of a tree is at least 1/2 the number of black pebbles needed to pebble the root. We extend this result to a larger class of acyclic directed graphs including pyramid graphs.
Keywords
Application software; Computational modeling; Computer languages; Computer science; Laboratories; Optimizing compilers; Program processors;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1983., 24th Annual Symposium on
Conference_Location
Tucson, AZ, USA
ISSN
0272-5428
Print_ISBN
0-8186-0508-1
Type
conf
DOI
10.1109/SFCS.1983.3
Filename
4568105
Link To Document