Pages that link to "Item:Q2777901"
From MaRDI portal
The following pages link to Algorithmic aspects of a chip-firing game (Q2777901):
Displaying 17 items.
- Order structure and energy of conflicting chip firing game (Q629747) (← links)
- Properties of chip-firing games on complete graphs (Q745934) (← links)
- Chip-firing games on graphs (Q805639) (← links)
- On the sandpile group of regular trees (Q872040) (← links)
- Meteor process on \({\mathbb Z}^d\) (Q892164) (← links)
- Strong spherical asymptotics for rotor-router aggregation and the divisible sandpile (Q1016096) (← links)
- Chip-firing and the critical group of a graph (Q1283502) (← links)
- Chip-firing games, potential theory on graphs, and spanning trees (Q1758511) (← links)
- A maximizing characteristic for critical configurations of chip-firing games on digraphs (Q1801042) (← links)
- The Tutte polynomial as a growth function (Q1818371) (← links)
- Lattices generated by chip firing game models: criteria and recognition algorithms (Q1943390) (← links)
- Growth of replacements (Q2094883) (← links)
- Compatible recurrent identities of the sandpile group and maximal stable configurations (Q2208354) (← links)
- Riemann-Roch and Abel-Jacobi theory on a finite graph (Q2383008) (← links)
- No Polynomial Bound for the Chip Firing Game on Directed Graphs (Q3974530) (← links)
- On lengths of burn-off chip-firing games (Q4995310) (← links)
- Experimental research on the welfare in a closed production network (Q5134233) (← links)
