Polynomial Bound for a Chip Firing Game on Graphs

From MaRDI portal
Revision as of 14:09, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3798269

DOI10.1137/0401039zbMath0652.68089OpenAlexW2026915189MaRDI QIDQ3798269

Gábor Tardos

Publication date: 1988

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0401039




Related Items (30)

Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile ModelsNo polynomial bound for the period of the parallel chip firing game on graphsRiemann-Roch and Abel-Jacobi theory on a finite graphSome Halting Problems for Abelian Sandpiles Are Undecidable in Dimension ThreeOn the sandpile group of regular treesAbelian sandpile model and Biggs-Merino polynomial for directed graphsUniversality of the chip-firing gameOn approximating the rank of graph divisorsAbelian networks. II: Halting on all inputsCompatible recurrent identities of the sandpile group and maximal stable configurationsNo Polynomial Bound for the Chip Firing Game on Directed GraphsParallel chip firing games on graphsChip-firing games on directed graphsOn graph parameters guaranteeing fast sandpile diffusionOn the complexity of sandpile critical avalanchesThe Complexity of Three-Dimensional Critical AvalanchesA constant bound for the periods of parallel chip-firing games with many chipsUnnamed ItemRecognizing hyperelliptic graphs in polynomial timeCoEulerian graphsThe chip firing game on \(n\)-cyclesOn the Complexity of Sandpile Prediction ProblemsProperties of chip-firing games on complete graphsAbelian Logic GatesGonality Sequences of GraphsRandom Walks, Electric Networks and The Transience Class problem of SandpilesSource reversal and chip firing on graphsAn exact bound on the number of chips of parallel chip-firing games that stabilizeThe chip-firing gameChip-firing games on graphs






This page was built for publication: Polynomial Bound for a Chip Firing Game on Graphs