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

@inproceedings{Khanna2010ApproximateSP,
  title={Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs},
  author={Neelesh Khanna and Surender Baswana},
  booktitle={STACS},
  year={2010}
}
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 the following query for any u, v, z ∈ V and t > 1. report t-approximate shortest path between u and v when vertex z fails We present data structures for… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
16 Citations
14 References
Similar Papers

Similar Papers

Loading similar papers…