Shane Saunders, Tadao Takaoka. Improved Shortest Path Algorithms for Nearly Acyclic Graphs. Theoretical Computer Science, 42:232-248, 2001. [doi]
@article{SaundersT01,
title = {Improved Shortest Path Algorithms for Nearly Acyclic Graphs},
author = {Shane Saunders and Tadao Takaoka},
year = {2001},
url = {http://www.elsevier.nl/locate/entcs/volume42.html},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/SaundersT01},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {42},
pages = {232-248},
}