No polynomial bound for the period of the parallel chip firing game on graphs

DOI10.1016/0304-3975(94)00131-2zbMath0874.68229OpenAlexW2021895265MaRDI QIDQ1349717

Maurice Tchuente, Eric Goles Chacc, Marcos A. Kiwi, René Ndoundam

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00131-2

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)

Related Items (14)

On the complexity of generalized Q2R automaton ⋮ Abelian networks IV. Dynamics of nonhalting networks ⋮ Universality of the chip-firing game ⋮ Dynamics of neural networks over undirected graphs ⋮ Computational complexity of threshold automata networks under different updating schemes ⋮ Parallel chip-firing on the complete graph: Devil’s staircase and Poincaré rotation number ⋮ A constant bound for the periods of parallel chip-firing games with many chips ⋮ Eric Goles ⋮ On the effects of firing memory in the dynamics of conjunctive networks ⋮ On the effects of firing memory in the dynamics of conjunctive networks ⋮ Source reversal and chip firing on graphs ⋮ An exact bound on the number of chips of parallel chip-firing games that stabilize ⋮ Motors and Impossible Firing Patterns in the Parallel Chip-Firing Game ⋮ On the limited increment parallel chip-firing game

Cites Work

• Chip-firing games on graphs
• Balancing vectors in the max norm
• Parallel chip firing games on graphs
• Games on line graphs and sand piles
• Disks, Balls, and Walls: Analysis of a Combinatorial Game
• Polynomial Bound for a Chip Firing Game on Graphs
• No Polynomial Bound for the Chip Firing Game on Directed Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: No polynomial bound for the period of the parallel chip firing game on graphs