Das, Bireswar; Datta, Samir; Prajakta, Nimbhorkar
(Springer Link, 2013-05)
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 (Jakoby and Tantau in Proceedings of FSTTCS’07: The 27th Annual Conference on Foundations of ...