1,529 research outputs found
Preserving Distances in Very Faulty Graphs
Preservers and additive spanners are sparse (hence cheap to store) subgraphs that preserve the distances between given pairs of nodes exactly or with some small additive error, respectively. Since real-world networks are prone to failures, it makes sense to study fault-tolerant versions of the above structures. This turns out to be a surprisingly difficult task. For every small but arbitrary set of edge or vertex failures, the preservers and spanners need to contain replacement paths around the faulted set. Unfortunately, the complexity of the interaction between replacement paths blows up significantly, even from 1 to 2 faults, and the structure of optimal preservers and spanners is poorly understood. In particular, no nontrivial bounds for preservers and additive spanners are known when the number of faults is bigger than 2.
Even the answer to the following innocent question is completely unknown: what is the worst-case size of a preserver for a single pair of nodes in the presence of f edge faults? There are no super-linear lower bounds, nor subquadratic upper bounds for f>2. In this paper we make substantial progress on this and other fundamental questions:
- We present the first truly sub-quadratic size fault-tolerant single-pair preserver in unweighted (possibly directed) graphs: for any n node graph and any fixed number f of faults, O~(fn^{2-1/2^f}) size suffices. Our result also generalizes to the single-source (all targets) case, and can be used to build new fault-tolerant additive spanners (for all pairs).
- The size of the above single-pair preserver grows to O(n^2) for increasing f. We show that this is necessary even in undirected unweighted graphs, and even if you allow for a small additive error: If you aim at size O(n^{2-eps}) for eps>0, then the additive error has to be Omega(eps f). This surprisingly matches known upper bounds in the literature.
- For weighted graphs, we provide matching upper and lower bounds for the single pair case. Namely, the size of the preserver is Theta(n^2) for f > 1 in both directed and undirected graphs, while for f=1 the size is Theta(n) in undirected graphs. For directed graphs, we have a superlinear upper bound and a matching lower bound.
Most of our lower bounds extend to the distance oracle setting, where rather than a subgraph we ask for any compact data structure
Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling
A distance labeling scheme is an assignment of bit-labels to the vertices of
an undirected, unweighted graph such that the distance between any pair of
vertices can be decoded solely from their labels. An important class of
distance labeling schemes is that of hub labelings, where a node
stores its distance to the so-called hubs , chosen so that for
any there is belonging to some shortest
path. Notice that for most existing graph classes, the best distance labelling
constructions existing use at some point a hub labeling scheme at least as a
key building block. Our interest lies in hub labelings of sparse graphs, i.e.,
those with , for which we show a lowerbound of
for the average size of the hubsets.
Additionally, we show a hub-labeling construction for sparse graphs of average
size for some , where is the
so-called Ruzsa-Szemer{\'e}di function, linked to structure of induced
matchings in dense graphs. This implies that further improving the lower bound
on hub labeling size to would require a
breakthrough in the study of lower bounds on , which have resisted
substantial improvement in the last 70 years. For general distance labeling of
sparse graphs, we show a lowerbound of , where is the communication complexity of the
Sum-Index problem over . Our results suggest that the best achievable
hub-label size and distance-label size in sparse graphs may be
for some
Path-Reporting Distance Oracles with Near-Logarithmic Stretch and Linear Size
Given an -vertex undirected graph , and a parameter , a
path-reporting distance oracle (or PRDO) is a data structure of size ,
that given a query , returns an -approximate shortest
path in within time . Here , and are
arbitrary functions.
A landmark PRDO due to Thorup and Zwick, with an improvement of Wulff-Nilsen,
has , and . The
size of this oracle is for all . Elkin and Pettie and
Neiman and Shabat devised much sparser PRDOs, but their stretch was
polynomially larger than the optimal . On the other hand, for
non-path-reporting distance oracles, Chechik devised a result with
, and .
In this paper we make a dramatic progress in bridging the gap between
path-reporting and non-path-reporting distance oracles. We devise a PRDO with
size ,
stretch and query time . We can also have size , stretch
and query time
.
Our results on PRDOs are based on novel constructions of approximate distance
preservers, that we devise in this paper. Specifically, we show that for any
, any , and any graph and a collection
of vertex pairs, there exists a -approximate preserver with
edges, where
. These new
preservers are significantly sparser than the previous state-of-the-art
approximate preservers due to Kogan and Parter.Comment: 61 pages, 3 figure
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]
- …