Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs (Q2355284)

From MaRDI portal
Revision as of 12:41, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references