Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs (Q2355284)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8205127120018005
0 references
0.792007565498352
0 references
0.7918925881385803
0 references
0.7745508551597595
0 references
0.7691314220428467
0 references
