Reachability Games on Automatic Graphs (Q3073641)

From MaRDI portal
Revision as of 18:56, 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
Reachability Games on Automatic Graphs
scientific article

    Statements

    title
    Reachability Games on Automatic Graphs (English)
    0 references
    author
    Daniel Neider
    0 references
    publication date
    11 February 2011
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q45
    0 references
    03D05
    0 references
    05C57
    0 references
    68Q32
    0 references
    zbMATH DE Number
    5850596
    0 references
    OpenAlex ID
    W1567370363
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3073641&oldid=35213723"
    Powered by MediaWiki