On the complexity of reconfiguration problems (Q631762)

From MaRDI portal
Revision as of 21:35, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of reconfiguration problems
scientific article

    Statements

    title
    On the complexity of reconfiguration problems (English)
    0 references
    author
    Takehiro Ito
    0 references
    Erik D. Demaine
    0 references
    Nicholas J. A. Harvey
    0 references
    Ryuhei Uehara
    0 references
    Yushi Uno
    0 references
    Martha Sideris
    0 references
    publication date
    14 March 2011
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68Q17
    0 references
    68R10
    0 references
    zbMATH DE Number
    5865590
    0 references
    zbMATH Keywords
    approximation
    0 references
    graph algorithm
    0 references
    PSPACE-complete
    0 references
    reachability on solution space
    0 references
    reconfiguration problems
    0 references
    Wikidata QID
    Q115940836
    0 references
    OpenAlex ID
    W1997048861
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q631762&oldid=35218570"
    Powered by MediaWiki