Algorithms for Chip-Firing on Weighted Graphs
arXiv:2311.00194
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 , we give an upper bound for the number of linearly equivalent -reduced divisors. Finally, we illustrate a method of finding all maximal unwinnable divisors on weighted graphs.
14 pages