Algorithmic Aspects of a Chip-Firing Game

DOI10.1017/S0963548301004886zbMath0987.05093MaRDI QIDQ2777901

Jan van den Heuvel

Publication date: 19 June 2002

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

chip-firing gamecritical configurationdollar gameoil game

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Related Items (7)

Riemann-Roch and Abel-Jacobi theory on a finite graph ⋮ On the sandpile group of regular trees ⋮ Meteor process on \({\mathbb Z}^d\) ⋮ Compatible recurrent identities of the sandpile group and maximal stable configurations ⋮ Experimental research on the welfare in a closed production network ⋮ Properties of chip-firing games on complete graphs ⋮ Strong spherical asymptotics for rotor-router aggregation and the divisible sandpile

This page was built for publication: Algorithmic Aspects of a Chip-Firing Game