A constant bound for the periods of parallel chip-firing games with many chips
DOI10.1007/S00013-010-0129-XzbMATH Open1230.05212OpenAlexW2144567430MaRDI QIDQ707952FDOQ707952
Authors: Paul Myer Kominers, Scott Duke Kominers 
Publication date: 8 October 2010
Published in: Archiv der Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00013-010-0129-x
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Games on graphs (graph-theoretic aspects) (05C57) Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80)
Cites Work
- Chip-firing and the critical group of a graph
- Chip firing and the Tutte polynomial
- Chip-firing games on graphs
- Balancing vectors in the max norm
- No polynomial bound for the period of the parallel chip firing game on graphs
- Polynomial Bound for a Chip Firing Game on Graphs
- Parallel chip firing games on graphs
Cited In (10)
- Equitable Candy Sharing
- Motors and impossible firing patterns in the parallel chip-firing game
- Computational Science - ICCS 2004
- On lengths of burn-off chip-firing games
- Parallel chip firing games on graphs
- No polynomial bound for the period of the parallel chip firing game on graphs
- Diffusion on graphs is eventually periodic
- Polynomial Bound for a Chip Firing Game on Graphs
- An exact bound on the number of chips of parallel chip-firing games that stabilize
- On the limited increment parallel chip-firing game
This page was built for publication: A constant bound for the periods of parallel chip-firing games with many chips
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q707952)
