NO POLYNOMIAL BOUND FOR THE PERIOD OF THE PARALLEL CHIP FIRING GAME ON GRAPHS

Authors
KIWI MA NDOUNDAM R TCHUENTE M GOLES E
Citation
Ma. Kiwi et al., NO POLYNOMIAL BOUND FOR THE PERIOD OF THE PARALLEL CHIP FIRING GAME ON GRAPHS, Theoretical computer science, 136(2), 1994, pp. 527-532
Citations number
10
Categorie Soggetti
Computer Sciences","Computer Science Theory & Methods
Journal title
Theoretical computer science → ACNP
ISSN journal
03043975
Volume
136
Issue
2
Year of publication
1994
Pages
527 - 532
Database
ISI
SICI code
0304-3975(1994)136:2<527:NPBFTP>2.0.ZU;2-4
Abstract
The following (solitaire) game is considered: Initially each node of a simple, connected, finite graph contains a finite number of chips. A move consists in firing all nodes with at least as many chips as their degree, where firing a node corresponds to sending one of the node's chips to each one of the node's neighbors.