Computer Science – Data Structures and Algorithms
Scientific paper
2010-01-06
Computer Science
Data Structures and Algorithms
12 pages STACS 2010
Scientific paper
Let $G=(V,E)$ be any undirected graph on $V$ vertices and $E$ edges. A path $\textbf{P}$ between any two vertices $u,v\in 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\in V$ and $t>1$: Report $t$-approximate shortest path between $u$ and $v$ when vertex $z$ fails We present data structures for the single source as well all-pairs versions of this problem. Our data structures guarantee optimal query time. Most impressive feature of our data structures is that their size {\em nearly} match the size of their best static counterparts.
No associations
LandOfFree
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graph will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-163916