Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs.

Andreas Jakoby Till Tantau Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. 216-227 2007 conf/fsttcs/2007 FSTTCS http://dx.doi.org/10.1007/978-3-540-77050-3_18 db/conf/fsttcs/fsttcs2007.html#JakobyT07