Cookies?
Library Header Image
LSE Research Online LSE Library Services

Algorithmic aspects of a chip-firing game

van den Heuvel, Jan (2001) Algorithmic aspects of a chip-firing game. Combinatorics, Probability and Computing, 10 (6). pp. 505-529. ISSN 0963-5483

[img]
Preview
PDF - Published Version
Download (561kB) | Preview

Identification Number: 10.1017/S0963548301004886

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.

Item Type: Article
Official URL: http://journals.cambridge.org/action/displayJourna...
Additional Information: © 2001 Cambridge University Press
Subjects: Q Science > QA Mathematics
Sets: Departments > Mathematics
Date Deposited: 18 Nov 2008 15:10
Last Modified: 24 Aug 2012 08:25
URI: http://eprints.lse.ac.uk/id/eprint/18470

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics