Andreas Jakoby, Till Tantau. Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. In Vikraman Arvind, Sanjiva Prasad, editors, FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings. Volume 4855 of Lecture Notes in Computer Science, pages 216-227, Springer, 2007. [doi]
Abstract is missing.