Article contents
Algorithmic Aspects of a Chip-Firing Game
Published online by Cambridge University Press: 10 December 2001
Abstract
Algorithmic aspects of a chip-firing game on a graph introduced by Biggs are studied. This variant of the chip-firing game, called the dollar game, has the properties that every starting configuration leads to a so-called critical configuration. The set of critical configurations has many interesting properties. In this paper it is proved that the number of steps needed to reach a critical configuration is polynomial in the number of edges of the graph and the number of chips in the starting configuration, but not necessarily in the size of the input. An alternative algorithm is also described and analysed.
- Type
- Research Article
- Information
- Copyright
- 2001 Cambridge University Press
- 10
- Cited by