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

Neelesh Khanna Surender Baswana

Let $G=(V,E)$ be any undirected graph on $V$ vertices and $E$ edges. A path $\text{P}$ between any two vertices $u,v\in V$ is said to be $t$-approximate shortest path if its leng…