Source reversal and chip firing on graphs

DOI10.1016/S0304-3975(99)00122-XzbMath0947.05039WikidataQ127724687 ScholiaQ127724687MaRDI QIDQ1575961

Erich Prisner, Eric Goles Chacc

Publication date: 23 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

discrete dynamicsconfigurationorientationchip firingparallel iterationreversal gamessource reversal

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Related Items

Full orientability of graphs with at most one dependent arc, Eric Goles, Structure of some sand piles model, Abelian Networks I. Foundations and Examples, Minimal free resolutions of the 𝐺-parking function ideal and the toppling ideal, Full Orientability of Graphs, Motors and Impossible Firing Patterns in the Parallel Chip-Firing Game

Cites Work

• Unnamed Item
• Chip-firing games on directed graphs
• Chip-firing games on graphs
• Parallel chip firing games on graphs
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• No polynomial bound for the period of the parallel chip firing game on graphs
• On reorienting graphs by pushing down maximal vertices. II
• Disks, Balls, and Walls: Analysis of a Combinatorial Game
• Polynomial Bound for a Chip Firing Game on Graphs