TY - JOUR

T1 - No polynomial bound for the period of the parallel chip firing game on graphs

AU - Kiwi, M. A.

AU - Ndoundam, R.

AU - Tchuente, M.

AU - Goles, E.

N1 - Funding Information:
Correspondence to: E. Goles, Departamento de Ingenieria, Matemfitica, Facultad de Ciencias Fisicas y Matemfiticas, Universidad de Chile, Casilla 170 correo 3, Santiago, Chile. Email: egoles@uchcecvm.cec. uchile.cl. *Supported by the Microprocessors and lnformatics Program of the United Nations University, Macao, and by the University of Yaound&l through research project no. 591017 ** Supported by FONDECYT 1940520-94 and by the Microprocessors and Informatics Program of the United Nations University, Macao. Part of this work was done while the author was at the University of Yaound6-1.

PY - 1994/12/26

Y1 - 1994/12/26

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0028731584&partnerID=8YFLogxK

U2 - 10.1016/0304-3975(94)00131-2

DO - 10.1016/0304-3975(94)00131-2

M3 - Article

AN - SCOPUS:0028731584

SN - 0304-3975

VL - 136

SP - 527

EP - 532

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 2

ER -