A comparison of two variations of a pebble game on graphs
From MaRDI portal
Publication:1149448
DOI10.1016/S0304-3975(81)80004-7zbMath0454.05031MaRDI QIDQ1149448
Publication date: 1981
Published in: Theoretical Computer Science (Search for Journal in Brave)
Trees (05C05) Linear programming (90C05) Directed graphs (digraphs), tournaments (05C20) Positional games (pursuit and evasion, etc.) (91A24)
Related Items
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