Liam Roditty, Uri Zwick. Replacement Paths and ::::k:::: Simple Shortest Paths in Unweighted Directed Graphs. In Luís Caires, Giuseppe F. Italiano, Luís Monteiro, Catuscia Palamidessi, Moti Yung, editors, Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings. Volume 3580 of Lecture Notes in Computer Science, pages 249-260, Springer, 2005. [doi]
@inproceedings{RodittyZ05,
title = {Replacement Paths and ::::k:::: Simple Shortest Paths in Unweighted Directed Graphs},
author = {Liam Roditty and Uri Zwick},
year = {2005},
doi = {10.1007/11523468_21},
url = {http://dx.doi.org/10.1007/11523468_21},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/RodittyZ05},
cites = {0},
citedby = {0},
pages = {249-260},
booktitle = {Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
editor = {Luís Caires and Giuseppe F. Italiano and Luís Monteiro and Catuscia Palamidessi and Moti Yung},
volume = {3580},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-27580-0},
}