The complexity of pebbling reachability and solvability in planar and outerplanar graphs (Q2449128)

From MaRDI portal
Revision as of 12:27, 8 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
The complexity of pebbling reachability and solvability in planar and outerplanar graphs
scientific article

    Statements

    The complexity of pebbling reachability and solvability in planar and outerplanar graphs (English)
    0 references
    0 references
    0 references
    0 references
    6 May 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    graph pebbling
    0 references
    outerplanar
    0 references
    NP-complete
    0 references
    0 references