The complexity of pursuit on a graph (Q673639)

From MaRDI portal
Revision as of 10:26, 27 May 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 pursuit on a graph
scientific article

    Statements

    title
    The complexity of pursuit on a graph (English)
    0 references
    author
    Arthur S. Goldstein
    0 references
    Edward M. Reingold
    0 references
    publication date
    28 February 1997
    0 references
    zbMATH Keywords
    PSPACE completeness
    0 references
    EXPTIME-completeness
    0 references

    Identifiers

    zbMATH DE Number
    985677
    0 references
    OpenAlex ID
    W2013405119
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q673639&oldid=34176898"
    Powered by MediaWiki