Pages that link to "Item:Q1349717"
From MaRDI portal
The following pages link to No polynomial bound for the period of the parallel chip firing game on graphs (Q1349717):
Displaying 20 items.
- Computational complexity of threshold automata networks under different updating schemes (Q475388) (← links)
- A constant bound for the periods of parallel chip-firing games with many chips (Q707952) (← links)
- Dynamics of neural networks over undirected graphs (Q889392) (← links)
- Parallel chip firing games on graphs (Q1184999) (← links)
- Universality of the chip-firing game (Q1392019) (← links)
- Source reversal and chip firing on graphs (Q1575961) (← links)
- Diffusion on graphs is eventually periodic (Q1713784) (← links)
- The chip firing game on \(n\)-cycles (Q1805374) (← links)
- An exact bound on the number of chips of parallel chip-firing games that stabilize (Q2085558) (← links)
- Eric Goles (Q2086708) (← links)
- On the limited increment parallel chip-firing game (Q2092410) (← links)
- On the complexity of generalized Q2R automaton (Q2134005) (← links)
- Parallel chip-firing on the complete graph: Devil’s staircase and Poincaré rotation number (Q3012886) (← links)
- No Polynomial Bound for the Chip Firing Game on Directed Graphs (Q3974530) (← links)
- Abelian networks IV. Dynamics of nonhalting networks (Q5063346) (← links)
- Motors and Impossible Firing Patterns in the Parallel Chip-Firing Game (Q5251658) (← links)
- On the effects of firing memory in the dynamics of conjunctive networks (Q5918927) (← links)
- On the effects of firing memory in the dynamics of conjunctive networks (Q5919282) (← links)
- Finite record sets of chip-firing games (Q6060071) (← links)
- Symmetrizable Boolean networks (Q6496146) (← links)
