Pages that link to "Item:Q5270136"
From MaRDI portal
The following pages link to On the complexity of the chip-firing reachability problem (Q5270136):
Displaying 4 items.
- Algorithmic aspects of rotor-routing and the notion of linear equivalence (Q1693169) (← links)
- Rotor-routing reachability is easy, chip-firing reachability is hard (Q2066002) (← links)
- Chip-firing based methods in the Riemann-Roch theory of directed graphs (Q2422214) (← links)
- Abelian networks IV. Dynamics of nonhalting networks (Q5063346) (← links)
