127 search results - page 2 / 26 » The Directed Planar Reachability Problem |
COCO
2006
Springer
13 years 9 months ago
2006
Springer
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
SODA
2010
ACM
14 years 3 months ago
2010
ACM
HYBRID
2001
Springer
13 years 10 months ago
2001
Springer
HYBRID
1995
Springer
13 years 9 months ago
1995
Springer
Abstract. In this paper we investigate the decidability of the reachability problem for planar non-linear hybrid systems. A planar hybrid system has the property that its state spa...
STACS
2010
Springer
14 years 22 days ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...