Sciweavers

STACS
2010
Springer

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

13 years 8 months ago
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
Neelesh Khanna, Surender Baswana
Added 09 Jul 2010
Updated 09 Jul 2010
Type Conference
Year 2010
Where STACS
Authors Neelesh Khanna, Surender Baswana
Comments (0)