On the Complexity of Sandpile Prediction Problems

Authors:
J. Andrés Montoya;Carolina Mejía
Affiliations:
Escuela de Matemáticas, Universidad Industrial de Santander, Bucaramanga, Santander, Colombia;Escuela de Matemáticas, Universidad Industrial de Santander, Bucaramanga, Santander, Colombia
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 7
Cited 1

Polynomial bound for a chip firing game on graphs

SIAM Journal on Discrete Mathematics
Chip-firing games on graphs

European Journal of Combinatorics
Chip-Firing Games on Directed Graphs

Journal of Algebraic Combinatorics: An International Journal
A Theory of Strict P-completeness

STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Grid Graph Reachability Problems

CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
The Computational Complexity of One-Dimensional Sandpiles

Theory of Computing Systems
The directed planar reachability problem

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science

On the complexity of sandpile critical avalanches

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.