Algorithms for Chip-Firing on Weighted Graphs
Abstract
We extend the notion of chip-firing to weighted graphs, and generalize the Greedy Algorithm and Dhar's Burning Algorithm to weighted graphs. For a vertex q ∈ V(), we give an upper bound for the number of linearly equivalent q-reduced divisors. Finally, we illustrate a method of finding all maximal unwinnable divisors on weighted graphs.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.