Neelesh Khanna, Surender Baswana. Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs. In Jean-Yves Marion, Thomas Schwentick, editors, 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France. Volume 5 of LIPIcs, pages 513-524, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2010. [doi]
@inproceedings{KhannaB10,
title = {Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs},
author = {Neelesh Khanna and Surender Baswana},
year = {2010},
doi = {10.4230/LIPIcs.STACS.2010.2481},
url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2010.2481},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/KhannaB10},
cites = {0},
citedby = {0},
pages = {513-524},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France},
editor = {Jean-Yves Marion and Thomas Schwentick},
volume = {5},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-939897-16-3},
}