On the computational complexity of a game of cops and robbers (Q1945941)

From MaRDI portal
Revision as of 22:58, 18 April 2024 by Importer (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 computational complexity of a game of cops and robbers
scientific article

    Statements

    title
    On the computational complexity of a game of cops and robbers (English)
    0 references
    author
    Marcello Mamino
    0 references
    publication date
    17 April 2013
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    cops and robber
    0 references
    pursuit game
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q17
    0 references
    05C57
    0 references
    91A24
    0 references
    zbMATH DE Number
    6154971
    0 references
    OpenAlex ID
    W1978284948
    0 references
    arXiv ID
    1202.6043
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1945941&oldid=33431936"
    Powered by MediaWiki