Restricted optimal pebbling is NP-hard

DOI10.1016/j.dam.2024.06.013zbMath1547.05198MaRDI QIDQ6611025

László F. Papp

Publication date: 26 September 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

graph pebblingoptimal pebblingrestricted optimal pebbling

Mathematics Subject Classification ID

Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57)

This page was built for publication: Restricted optimal pebbling is NP-hard