Reachability on prefix-recognizable graphs (Q975403)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5719155
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reachability on prefix-recognizable graphs |
scientific article; zbMATH DE number 5719155 |
Statements
Reachability on prefix-recognizable graphs (English)
0 references
9 June 2010
0 references
reachability
0 references
prefix-recognizable graphs
0 references
computational complexity
0 references
alternation
0 references
