Temporal Cliques admit Sparse Spanners

by   Arnaud Casteigts, et al.

Let G=(G,λ) be a labeled graph on n vertices with λ:E_G→N a locally injective mapping that assigns to every edge a unique integer label. The label is seen as a discrete time when the edge is present. This graph is temporally connected if a path exists with increasing labels from every vertex to every other vertex. We investigate a question by Kempe, Kleinberg, and Kumar (JCSS 2002), asking whether sparse subsets of edges can always be found that preserve temporal connectivity if the rest is removed. We call such subsets temporal spanners of G. Despite the simplicity of the model, no significative progress has been made so far on this question; the only known result is that Ω(n) edges can always be removed if G is a complete graph. In this paper, we settle the question (affirmatively) for complete graphs, showing that all edges but a sub-quadratic amount of them (namely O(n n)) can always be removed, making the first significant progress towards the original question. This is done in several gradual steps. First, we observe that the existing argument for removing Θ(n) edges can be generalized to removing Θ(n^2) edges (namely, a sixth of the edges). Then, building on top of a gradual set of techniques, we establish that a quarter of the edges can always be removed, then half of the edges, and eventually all but O(n n) edges. These results are robust in the sense that they extend, with reasonable assumptions, to general graph models where the labels may not be locally unique and every edge may have several labels. We conjecture that sparse spanners always exist in the general case (G not being complete) and we hope that some of our techniques might be used in this perspective.


page 1

page 2

page 3

page 4


Sparse universal graphs for planarity

We show that for every integer n≥ 1 there exists a graph G_n with (1+o(1...

Combining Orthology and Xenology Data in a Common Phylogenetic Tree

A rooted tree T with vertex labels t(v) and set-valued edge labels λ(e) ...

A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs

A temporal graph is a graph in which edges are assigned a time label. Tw...

Improved Bounds for Guarding Plane Graphs with Edges

An "edge guard set" of a plane graph G is a subset Γ of edges of G such ...

Short edges and noncrossing paths in complete topological graphs

Let h(n) be the minimum integer such that every complete n-vertex simple...

Õptimal Dual Vertex Failure Connectivity Labels

In this paper we present succinct labeling schemes for supporting connec...

Please sign up or login with your details

Forgot password? Click here to reset