Go to the corresponding Portal 
Jakoby, Andreas ; Tantau, Till
pdfformat: 

@InProceedings{jakoby_et_al:DagSemProc.06111.6, author = {Jakoby, Andreas and Tantau, Till}, title = {{Computing Shortest Paths in SeriesParallel Graphs in Logarithmic Space}}, booktitle = {Complexity of Boolean Functions}, pages = {19}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {18624405}, year = {2006}, volume = {6111}, editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2006/618}, URN = {urn:nbn:de:0030drops6185}, doi = {10.4230/DagSemProc.06111.6}, annote = {Keywords: Seriesparallel graphs, shortest path, logspace} }
Keywords:  Seriesparallel graphs, shortest path, logspace  
Collection:  06111  Complexity of Boolean Functions  
Issue Date:  2006  
Date of publication:  30.11.2006 