A constant bound for the periods of parallel chip-firing games with many chips
From MaRDI portal
Publication:707952
DOI10.1007/s00013-010-0129-xzbMath1230.05212OpenAlexW2144567430MaRDI QIDQ707952
Scott Duke Kominers, Paul Myer 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
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57)
Related Items
Equitable Candy Sharing ⋮ An exact bound on the number of chips of parallel chip-firing games that stabilize ⋮ 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
- Chip-firing and the critical group of a graph
- No polynomial bound for the period of the parallel chip firing game on graphs
- Chip firing and the Tutte polynomial
- Polynomial Bound for a Chip Firing Game on Graphs
