Parallel chip firing games on graphs
From MaRDI portal
Publication:1184999
DOI10.1016/0304-3975(92)90316-8zbMath0745.05054OpenAlexW2070077200MaRDI QIDQ1184999
Javier Bitar, Eric Goles Chacc
Publication date: 28 June 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(92)90316-8
Related Items (21)
No polynomial bound for the period of the parallel chip firing game on graphs ⋮ Abelian networks IV. Dynamics of nonhalting networks ⋮ Some Halting Problems for Abelian Sandpiles Are Undecidable in Dimension Three ⋮ Universality of the chip-firing game ⋮ Two sided Sand Piles Model and unimodal sequences ⋮ Computational universality of fungal sandpile automata ⋮ Fixed-point forms of the parallel symmetric sandpile model ⋮ Experimental research on the welfare in a closed production network ⋮ Parallel chip-firing on the complete graph: Devil’s staircase and Poincaré rotation number ⋮ Parallel cleaning of a network with brushes ⋮ A constant bound for the periods of parallel chip-firing games with many chips ⋮ Eric Goles ⋮ Games on line graphs and sand piles ⋮ Parallel transient time of one-dimensional sand pile ⋮ Meeting covered elements in \(\nu\)-Tamari lattices ⋮ Source reversal and chip firing on graphs ⋮ An exact bound on the number of chips of parallel chip-firing games that stabilize ⋮ On fungal automata ⋮ Motors and Impossible Firing Patterns in the Parallel Chip-Firing Game ⋮ On the limited increment parallel chip-firing game ⋮ The chip-firing game
Cites Work
This page was built for publication: Parallel chip firing games on graphs
