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)
05C05: Trees
90C05: Linear programming
05C20: Directed graphs (digraphs), tournaments
91A24: Positional games (pursuit and evasion, etc.)
Related Items
Min Cut is NP-complete for edge weighted trees, White pebbles help, On the power of white pebbles, Searching and pebbling, Bandwidth and pebbling, An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
Cites Work