11 search results - page 3 / 3 » On the Decidability of the Reachability Problem for Planar D... |
STACS
2010
Springer
14 years 9 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 ...