pdfformat: 

@InProceedings{jakoby_et_al:DSP:2006:618, author = {Andreas Jakoby and Till Tantau}, title = {Computing Shortest Paths in SeriesParallel Graphs in Logarithmic Space}, booktitle = {Complexity of Boolean Functions}, year = {2006}, editor = {Matthias Krause and Pavel Pudl{\'a}k and R{\"u}diger Reischuk and Dieter van Melkebeek}, number = {06111}, series = {Dagstuhl Seminar Proceedings}, ISSN = {18624405}, publisher = {Internationales Begegnungs und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2006/618}, annote = {Keywords: Seriesparallel graphs, shortest path, logspace} }
Keywords:  Seriesparallel graphs, shortest path, logspace  
Seminar:  06111  Complexity of Boolean Functions  
Related Scholarly Article:  
Issue date:  2006  
Date of publication:  2006 