| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 421738 | Electronic Notes in Theoretical Computer Science | 2009 | 17 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
