Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs (Q2355284): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00026-015-0266-9 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00026-015-0266-9 / rank | |||
Normal rank | |||
Latest revision as of 04:13, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs |
scientific article |
Statements
Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs (English)
0 references
22 July 2015
0 references
chip-firing game
0 references
critical configuration
0 references
recurrent configuration
0 references
Eulerian digraph
0 references
feedback arc set
0 references
complexity
0 references
sandpile model
0 references
0 references
