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]
Abstract is missing.