A comparison of two variations of a pebble game on graphs

DOI10.1016/S0304-3975(81)80004-7zbMath0454.05031MaRDI QIDQ1149448

Friedhelm Meyer auf der Heide

Publication date: 1981

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

directed acyclic graphBlack Pebble GameBlack White Pebble Game

Mathematics Subject Classification ID

Related Items (7)

Min Cut is NP-complete for edge weighted trees ⋮ White pebbles help ⋮ An Application of Generalized Tree Pebbling to Sparse Matrix Factorization ⋮ On the power of white pebbles ⋮ Reversible pebble games and the relation between tree-like and general resolution space ⋮ Searching and pebbling ⋮ Bandwidth and pebbling

Cites Work

• Unnamed Item
• An observation on time-storage trade off
• Storage requirements for deterministic polynomial time recognizable languages
• On Time Versus Space
• Space bounds for a game on graphs

This page was built for publication: A comparison of two variations of a pebble game on graphs