Pages that link to "Item:Q685991"
From MaRDI portal
The following pages link to Chip-firing games on directed graphs (Q685991):
Displaying 48 items.
- Chip-firing game and a partial Tutte polynomial for Eulerian digraphs (Q276208) (← links)
- Dynamic graph models and their properties (Q276764) (← links)
- Multi-Eulerian tours of directed graphs (Q281626) (← links)
- Control of limit states in absorbing resource networks (Q463333) (← links)
- Strong emergence of wave patterns on Kadanoff sandpiles (Q528976) (← links)
- Chip firing on Dynkin diagrams and McKay quivers (Q667637) (← links)
- Random walks and flights over connected graphs and complex networks (Q718283) (← links)
- Properties of chip-firing games on complete graphs (Q745934) (← links)
- On the sandpile group of regular trees (Q872040) (← links)
- A study of Euler resource networks (Q891491) (← links)
- Abelian networks. II: Halting on all inputs (Q907072) (← links)
- Markov chain methods for analyzing urban networks (Q960151) (← links)
- Chip-firing and the critical group of a graph (Q1283502) (← links)
- Reachability is decidable in the numbers game (Q1331936) (← links)
- Chip firing and the Tutte polynomial (Q1387615) (← links)
- Universality of the chip-firing game (Q1392019) (← links)
- Classes of lattices induced by chip firing (and sandpile) dynamics. (Q1404997) (← links)
- Source reversal and chip firing on graphs (Q1575961) (← links)
- Abelian sandpile model and Biggs-Merino polynomial for directed graphs (Q1679328) (← links)
- Algorithmic aspects of rotor-routing and the notion of linear equivalence (Q1693169) (← links)
- Spanning trees and recurrent configurations of a graph (Q1740077) (← links)
- A maximizing characteristic for critical configurations of chip-firing games on digraphs (Q1801042) (← links)
- Sandpile models and lattices: a comprehensive survey (Q1885925) (← links)
- Strong convergence and the polygon property of 1-player games (Q1917518) (← links)
- The sandpile group of a family of nearly complete graphs (Q2021647) (← links)
- Rotor-routing reachability is easy, chip-firing reachability is hard (Q2066002) (← links)
- A survey on the stability of (extended) linear Sand Pile model (Q2086732) (← links)
- Growth of replacements (Q2094883) (← links)
- A decomposition algorithm for computing income taxes with pass-through entities and its application to the Chilean case (Q2178362) (← links)
- Compatible recurrent identities of the sandpile group and maximal stable configurations (Q2208354) (← links)
- Resource allocation among attractor vertices in asymmetric regular resource networks (Q2289044) (← links)
- Resource network with limited capacity of attractor vertices (Q2290392) (← links)
- Root system chip-firing. I: Interval-firing (Q2312841) (← links)
- Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph (Q2354726) (← links)
- Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs (Q2355284) (← links)
- Riemann-Roch and Abel-Jacobi theory on a finite graph (Q2383008) (← links)
- Chip-firing based methods in the Riemann-Roch theory of directed graphs (Q2422214) (← links)
- Strict partitions and discrete dynamical systems (Q2465628) (← links)
- The chip-firing game (Q2575794) (← links)
- CoEulerian graphs (Q2802106) (← links)
- On the Complexity of Sandpile Prediction Problems (Q2811962) (← links)
- Chip-Firing, Antimatroids, and Polyhedra (Q2851431) (← links)
- (Q5002644) (← links)
- The sandpile group of a thick cycle graph (Q5054061) (← links)
- Abelian networks IV. Dynamics of nonhalting networks (Q5063346) (← links)
- On the complexity of the chip-firing reachability problem (Q5270136) (← links)
- On approximating the rank of graph divisors (Q6098103) (← links)
- Geometric and spectral analysis on weighted digraphs (Q6199678) (← links)
