35 citations · 37 across the 3 of their papers we have counts for
1 paper · 1 filter
Jeremiah Blocki, Samson Zhou
We consider the computational complexity of finding a legal black pebbling of a DAG G=(V,E) with minimum cumulative cost. A black pebbling is a sequence $P_0,\ldots, P_t \subsete…