| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429175 | Information Processing Letters | 2008 | 4 Pages |
Abstract
We prove that on prefix-recognizable graphs reachability is complete for deterministic exponential time matching the complexity of alternating reachability.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
