Pages that link to "Item:Q2355284"
From MaRDI portal
The following pages link to Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs (Q2355284):
Displaying 6 items.
- Chip-firing game and a partial Tutte polynomial for Eulerian digraphs (Q276208) (← links)
- Riemann-Roch theory for graph orientations (Q509688) (← 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)
- Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph (Q2354726) (← links)
- Chip-firing based methods in the Riemann-Roch theory of directed graphs (Q2422214) (← links)
