scientific article; zbMATH DE number 3952825

MaRDI QIDQ3722545zbMATH OpenFDO

Authors Maria M. Klawe

Publication date 1985

zbMATH Keywords

acyclic directed graphblack pebble numbernice graphspolynomial algorithmspreading graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (05C99) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The Complexity of Graph Pebbling
• A tight bound for black and white pebbles on the pyramid
• scientific article; zbMATH DE number 1145909
• Pebbling in semi-2-trees
• Pebbling in 2-paths

Cited in

(5)

• Inapproximability of the standard pebble game and hard to pebble graphs
• Pebbling meets coloring: reversible pebble game on trees
• Pebbling Algorithms in Diameter Two Graphs
• The Complexity of Graph Pebbling
• On the target pebbling conjecture

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3722545)