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]
@inproceedings{JakobyT07, title = {Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs}, author = {Andreas Jakoby and Till Tantau}, year = {2007}, doi = {10.1007/978-3-540-77050-3_18}, url = {http://dx.doi.org/10.1007/978-3-540-77050-3_18}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/JakobyT07}, cites = {0}, citedby = {0}, pages = {216-227}, booktitle = {FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings}, editor = {Vikraman Arvind and Sanjiva Prasad}, volume = {4855}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-540-77049-7}, }