The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration (Q2946012)

From MaRDI portal
Revision as of 22:01, 23 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
The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration
scientific article

    Statements

    The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 September 2015
    0 references

    Identifiers