Sciweavers

54
Voted
IPL
2008
107views more  IPL 2008»
14 years 9 months ago
Reachability on prefix-recognizable graphs
We prove that on prefix-recognizable graphs reachability is complete for deterministic exponential time matching the complexity of alternating reachability. Key words: Reachabilit...
Stefan Göller