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

Neelesh Khanna 1, * Surender Baswana 2
* Corresponding author
1 Oracle India Pvt. Ltd
2 IIT Kanpur - Indian Institute of Technology Kanpur
Abstract : 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.
Mots-clés : Shortest path distance distance queries oracle
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download
https://hal.inria.fr/inria-00455747
Contributor : Publications Loria <>
Submitted on : Thursday, February 11, 2010 - 10:03:36 AM
Last modification on : Sunday, July 22, 2018 - 9:10:03 AM
Long-term archiving on : Friday, June 18, 2010 - 8:09:41 PM

File

khanna.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00455747, version 1

Collections

STACS2010

Citation

Neelesh Khanna, Surender Baswana. Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graph. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.513-524. ⟨inria-00455747⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

199

Files downloads

213

Contact


archive-ouverte@inria.fr