Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs.

Neelesh Khanna, Surender Baswana

Browse the full STACS paper archive.