Lin Tian, Tadao Takaoka. Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs. In Gillian Dobbie, editor, Computer Science 2007. Proceedings of the Thirtieth Australasian Computer Science Conference (ACSC2007). Ballarat, Victoria, Australia, January 30 - February 2, 2007. Proceedings. Volume 62 of CRPIT, pages 15-24, Australian Computer Society, 2007. [doi]
@inproceedings{TianT07:0,
title = {Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs},
author = {Lin Tian and Tadao Takaoka},
year = {2007},
url = {http://crpit.com/abstracts/CRPITV62Tian.html},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/TianT07%3A0},
cites = {0},
citedby = {0},
pages = {15-24},
booktitle = {Computer Science 2007. Proceedings of the Thirtieth Australasian Computer Science Conference (ACSC2007). Ballarat, Victoria, Australia, January 30 - February 2, 2007. Proceedings},
editor = {Gillian Dobbie},
volume = {62},
series = {CRPIT},
publisher = {Australian Computer Society},
isbn = {1-920-68243-0},
}