Polynomial Bound for a Chip Firing Game on Graphs
Gábor Tardos · SIAM Journal on Discrete Mathematics · 1988
Björner, Lvász, and Shor have introduced a chip firing game on graphs. This paper proves a polynomial bound on the length of the game in terms of the number of vertices of the graph provided the length is finite. The obtained bound is best possible within a constant factor.