Reachability on prefix-recognizable graphs (Q975403): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 20:49, 30 January 2024

scientific article
Language Label Description Also known as
English
Reachability on prefix-recognizable graphs
scientific article

    Statements

    Reachability on prefix-recognizable graphs (English)
    0 references
    0 references
    9 June 2010
    0 references
    0 references
    reachability
    0 references
    prefix-recognizable graphs
    0 references
    computational complexity
    0 references
    alternation
    0 references