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

Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t times the length of the shortest path between u and v. We consider the problem of building a compact data structure for a given graph G which is capable of answering

• Type: Conference
• Year: 2010
• Where: STACS
• Authors: Neelesh Khanna, Surender Baswana
• Keywords: Shortest Path, STACS 2010, T-approximate Shortest Path, Theoretical Computer Science