Computational Complexity of the $$r$$-visibility Guard Set Problem for Polyominoes (Q2945667)

From MaRDI portal
Revision as of 19:01, 10 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
Computational Complexity of the $$r$$-visibility Guard Set Problem for Polyominoes
scientific article

    Statements

    Computational Complexity of the $$r$$-visibility Guard Set Problem for Polyominoes (English)
    0 references
    0 references
    0 references
    14 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    art gallery problem
    0 references
    polyomino
    0 references
    \(r\)-visibility
    0 references
    NP-hardness
    0 references
    0 references