Abstract

In this work we study the complexity of Sandpile prediction problems on several classes of directed graphs. We focus our research on low-dimensional directed lattices. We prove some upper and lower bounds for those problems. Our approach is based on the analysis of some reachability problems related to sandpiles.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call