DeepAI AI Chat
Log In Sign Up

Sparse Temporal Spanners with Low Stretch

by   Davide Bilò, et al.
Università degli Studi dell'Aquila
University of Rome Tor Vergata

A temporal graph is an undirected graph G=(V,E) along with a function that assigns a time-label to each edge in E. A path in G with non-decreasing time-labels is called temporal path and the distance from u to v is the minimum length (i.e., the number of edges) of a temporal path from u to v. A temporal α-spanner of G is a (temporal) subgraph H that preserves the distances between any pair of vertices in V, up to a multiplicative stretch factor of α. The size of H is the number of its edges. In this work we study the size-stretch trade-offs of temporal spanners. We show that temporal cliques always admit a temporal (2k-1)-spanner with Õ(kn^1+1/k) edges, where k>1 is an integer parameter of choice. Choosing k=⌊log n⌋, we obtain a temporal O(log n)-spanner with Õ(n) edges that has almost the same size (up to logarithmic factors) as the temporal spanner in [Casteigts et al., JCSS 2021] which only preserves temporal connectivity. We then consider general temporal graphs. Since Ω(n^2) edges might be needed by any connectivity-preserving temporal subgraph [Axiotis et al., ICALP'16], we focus on approximating distances from a single source. We show that Õ(n/log(1+ε)) edges suffice to obtain a stretch of (1+ε), for any small ε>0. This result is essentially tight since there are temporal graphs for which any temporal subgraph preserving exact distances from a single-source must use Ω(n^2) edges. We extend our analysis to prove an upper bound of Õ(n^2/β) on the size of any temporal β-additive spanner, which is tight up to polylogarithmic factors. Finally, we investigate how the lifetime of G, i.e., the number of its distinct time-labels, affects the trade-off between the size and the stretch of a temporal spanner.


page 1

page 2

page 3

page 4


Roundtrip Spanners with (2k-1) Stretch

A roundtrip spanner of a directed graph G is a subgraph of G preserving ...

Sharp Thresholds in Random Simple Temporal Graphs

A graph whose edges only appear at certain points in time is called a te...

Spanner Approximations in Practice

A multiplicative α-spanner H is a subgraph of G=(V,E) with the same vert...

A Faster Parameterized Algorithm for Temporal Matching

A temporal graph is a sequence of graphs (called layers) over the same v...

A Unified Framework for Hopsets and Spanners

Given an undirected graph G=(V,E), an (α,β)-spanner H=(V,E') is a subgra...

Temporal Cliques admit Sparse Spanners

Let G=(G,λ) be a labeled graph on n vertices with λ:E_G→N a locally inj...

Inapproximability of Additive Weak Contraction under SSEH and Strong UGC

Succinct representations of a graph have been objects of central study i...