Tadao Takaoka. Shortest Path Algorithms for Nearly Acyclic Directed Graphs. In Fabrizio d Amore, Paolo Giulio Franciosa, Alberto Marchetti-Spaccamela, editors, Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG 96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings. Volume 1197 of Lecture Notes in Computer Science, pages 367-374, Springer, 1996.
@inproceedings{Takaoka96,
title = {Shortest Path Algorithms for Nearly Acyclic Directed Graphs},
author = {Tadao Takaoka},
year = {1996},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Takaoka96},
cites = {0},
citedby = {0},
pages = {367-374},
booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG 96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings},
editor = {Fabrizio d Amore and Paolo Giulio Franciosa and Alberto Marchetti-Spaccamela},
volume = {1197},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-62559-3},
}