TY - GEN

T1 - An optimal dual fault tolerant reachability oracle

AU - Choudhary, Keerti

N1 - Publisher Copyright:
© Keerti Choudhary.

PY - 2016/8/1

Y1 - 2016/8/1

N2 - Let G = (V,E) be an n-vertices m-edges directed graph. Let s 2 V be any designated source vertex. We address the problem of reporting the reachability information from s under two vertex failures. We show that it is possible to compute in polynomial time an O(n) size data structure that for any query vertex v, and any pair of failed vertices f1, f2, answers in O(1) time whether or not there exists a path from s to v in G \ {f1, f2}. For the simpler case of single vertex failure such a data structure can be obtained using the dominator-tree from the celebrated work of Lengauer and Tarjan [TOPLAS 1979, Vol. 1]. However, no efficient data structure was known in the past for handling more than one failures. We, in addition, also present a labeling scheme with O(log3 n)-bit size labels such that for any f1, f2, v 2 V , it is possible to determine in poly-logarithmic time if v is reachable from s in G \ {f1, f2} using only the labels of f1, f2 and v. Our data structure can also be seen as an efficient mechanism for verifying double-dominators. For any given x, y, v 2 V we can determine in O(1) time if the pair (x, y) is a double-dominator of v. Earlier the best known method for this problem was using dominator chain from which verification of double-dominators of only a single vertex was possible.

AB - Let G = (V,E) be an n-vertices m-edges directed graph. Let s 2 V be any designated source vertex. We address the problem of reporting the reachability information from s under two vertex failures. We show that it is possible to compute in polynomial time an O(n) size data structure that for any query vertex v, and any pair of failed vertices f1, f2, answers in O(1) time whether or not there exists a path from s to v in G \ {f1, f2}. For the simpler case of single vertex failure such a data structure can be obtained using the dominator-tree from the celebrated work of Lengauer and Tarjan [TOPLAS 1979, Vol. 1]. However, no efficient data structure was known in the past for handling more than one failures. We, in addition, also present a labeling scheme with O(log3 n)-bit size labels such that for any f1, f2, v 2 V , it is possible to determine in poly-logarithmic time if v is reachable from s in G \ {f1, f2} using only the labels of f1, f2 and v. Our data structure can also be seen as an efficient mechanism for verifying double-dominators. For any given x, y, v 2 V we can determine in O(1) time if the pair (x, y) is a double-dominator of v. Earlier the best known method for this problem was using dominator chain from which verification of double-dominators of only a single vertex was possible.

KW - Directed graph

KW - Fault tolerant

KW - Labeling scheme

KW - Reachability oracle

UR - http://www.scopus.com/inward/record.url?scp=85012922374&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.ICALP.2016.130

DO - 10.4230/LIPIcs.ICALP.2016.130

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85012922374

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016

A2 - Rabani, Yuval

A2 - Chatzigiannakis, Ioannis

A2 - Sangiorgi, Davide

A2 - Mitzenmacher, Michael

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016

Y2 - 12 July 2016 through 15 July 2016

ER -