27 research outputs found
An Optimal Dual Fault Tolerant Reachability Oracle
Let G=(V,E) be an n-vertices m-edges directed graph. Let s inV 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 f_1, f_2, answers in O(1) time whether or not there exists a path from s to v in G{f_1,f_2}.
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(log^3(n))-bit size labels such that for any f_1, f_2, v in Vit is possible to determine in poly-logarithmic time if v is reachable from s in G{f_1,f_2} using only the labels of f1, f_2 and v.
Our data structure can also be seen as an efficient mechanism for verifying double-dominators. For any given x, y, v in 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
New Extremal Bounds for Reachability and Strong-Connectivity Preservers Under Failures
In this paper, we consider the question of computing sparse subgraphs for any
input directed graph on vertices and edges, that preserves
reachability and/or strong connectivity structures.
We show bound on a
subgraph that is an -fault-tolerant reachability preserver for a given
vertex-pair set , i.e., it preserves reachability
between any pair of vertices in under single edge (or vertex)
failure. Our result is a significant improvement over the previous best bound obtained as a corollary of single-source reachability
preserver construction. We prove our upper bound by exploiting the special
structure of single fault-tolerant reachability preserver for any pair, and
then considering the interaction among such structures for different pairs.
In the lower bound side, we show that a 2-fault-tolerant reachability
preserver for a vertex-pair set of size
, for even any arbitrarily small , requires at
least edges. This refutes the existence of
linear-sized dual fault-tolerant preservers for reachability for any polynomial
sized vertex-pair set.
We also present the first sub-quadratic bound of at most size, for strong-connectivity preservers of directed graphs under
failures. To the best of our knowledge no non-trivial bound for this
problem was known before, for a general . We get our result by adopting the
color-coding technique of Alon, Yuster, and Zwick [JACM'95]
An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model
In this paper we study the problem of maintaining the strongly connected components of a graph in the presence of failures. In particular, we show that given a directed graph G=(V,E) with n=|V| and m=|E|, and an integer value kgeq 1, there is an algorithm that computes in O(2^{k}n log^2 n) time for any set F of size at most k the strongly connected components of the graph GF. The running time of our algorithm is almost optimal since the time for outputting the SCCs of GF is at least Omega(n). The algorithm uses a data structure that is computed in a preprocessing phase in polynomial time and is of size O(2^{k} n^2).
Our result is obtained using a new observation on the relation between strongly connected components (SCCs) and reachability. More specifically, one of the main building blocks in our result is a restricted variant of the problem in which we only compute strongly connected components that intersect a certain path. Restricting our attention to a path allows us to implicitly compute reachability between the path vertices and the rest of the graph in time that depends logarithmically rather than linearly in the size of the path. This new observation alone, however, is not enough, since we need to find an efficient way to represent the strongly connected components using paths. For this purpose we use a mixture of old and classical techniques such as the heavy path decomposition of Sleator and Tarjan and the classical Depth-First-Search algorithm. Although, these are by now standard techniques, we are not aware of any usage of them in the context of dynamic maintenance of SCCs. Therefore, we expect that our new insights and mixture of new and old techniques will be of independent interest
Efficiently Realizing Interval Sequences
We consider the problem of realizable interval-sequences. An interval
sequence comprises of integer intervals such that , and is said to be graphic/realizable if there exists a
graph with degree sequence, say, satisfying the condition
, for each . There is a characterisation
(also implying an verifying algorithm) known for realizability of
interval-sequences, which is a generalization of the Erdos-Gallai
characterisation for graphic sequences. However, given any realizable
interval-sequence, there is no known algorithm for computing a corresponding
graphic certificate in time.
In this paper, we provide an time algorithm for computing a
graphic sequence for any realizable interval sequence. In addition, when the
interval sequence is non-realizable, we show how to find a graphic sequence
having minimum deviation with respect to the given interval sequence, in the
same time. Finally, we consider variants of the problem such as computing the
most regular graphic sequence, and computing a minimum extension of a length
non-graphic sequence to a graphic one.Comment: 19 pages, 1 figur
Fault-Tolerant ST-Diameter Oracles
We study the problem of estimating the ST-diameter of a graph that is subject to a bounded number of edge failures. An f-edge fault-tolerant ST-diameter oracle (f-FDO-ST) is a data structure that preprocesses a given graph G, two sets of vertices S,T, and positive integer f. When queried with a set F of at most f edges, the oracle returns an estimate D? of the ST-diameter diam(G-F,S,T), the maximum distance between vertices in S and T in G-F. The oracle has stretch ? ? 1 if diam(G-F,S,T) ? D? ? ? diam(G-F,S,T). If S and T both contain all vertices, the data structure is called an f-edge fault-tolerant diameter oracle (f-FDO). An f-edge fault-tolerant distance sensitivity oracles (f-DSO) estimates the pairwise graph distances under up to f failures.
We design new f-FDOs and f-FDO-STs by reducing their construction to that of all-pairs and single-source f-DSOs. We obtain several new tradeoffs between the size of the data structure, stretch guarantee, query and preprocessing times for diameter oracles by combining our black-box reductions with known results from the literature.
We also provide an information-theoretic lower bound on the space requirement of approximate f-FDOs. We show that there exists a family of graphs for which any f-FDO with sensitivity f ? 2 and stretch less than 5/3 requires ?(n^{3/2}) bits of space, regardless of the query time
Minimum Neighboring Degree Realization in Graphs and Trees
We study a graph realization problem that pertains to degrees in vertex neighborhoods. The classical problem of degree sequence realizability asks whether or not a given sequence of n positive integers is equal to the degree sequence of some n-vertex undirected simple graph. While the realizability problem of degree sequences has been well studied for different classes of graphs, there has been relatively little work concerning the realizability of other types of information profiles, such as the vertex neighborhood profiles.
In this paper we introduce and explore the minimum degrees in vertex neighborhood profile as it is one of the most natural extensions of the classical degree profile to vertex neighboring degree profiles. Given a graph G = (V,E), the min-degree of a vertex v ? V, namely MinND(v), is given by min{deg(w) ? w ? N[v]}. Our input is a sequence ? = (d_?^{n_?}, ?d?^{n?}), where d_{i+1} > d_i and each n_i is a positive integer. We provide some necessary and sufficient conditions for ? to be realizable. Furthermore, under the restriction that the realization is acyclic, i.e., a tree or a forest, we provide a full characterization of realizable sequences, along with a corresponding constructive algorithm.
We believe our results are a crucial step towards understanding extremal neighborhood degree relations in graphs