61 research outputs found
Temporal Cliques Admit Sparse Spanners
Let G=(V,E) be an undirected graph on n vertices and lambda:E -> 2^{N} a mapping that assigns to every edge a non-empty set of positive integer labels. These labels can be seen as discrete times when the edge is present. Such a labeled graph {G}=(G,lambda) is said to be temporally connected if a path exists with non-decreasing times from every vertex to every other vertex. In a seminal paper, Kempe, Kleinberg, and Kumar (STOC 2000) asked whether, given such a temporal graph, a sparse subset of edges can always be found whose labels suffice to preserve temporal connectivity - a temporal spanner. Axiotis and Fotakis (ICALP 2016) answered negatively by exhibiting a family of Theta(n^2)-dense temporal graphs which admit no temporal spanner of density o(n^2). The natural question is then whether sparse temporal spanners always exist in some classes of dense graphs.
In this paper, we answer this question affirmatively, by showing that if the underlying graph G is a complete graph, then one can always find temporal spanners of density O(n log n). The best known result for complete graphs so far was that spanners of density binom{n}{2}- floor[n/4] = O(n^2) always exist. Our result is the first positive answer as to the existence of o(n^2) sparse spanners in adversarial instances of temporal graphs since the original question by Kempe et al., focusing here on complete graphs. The proofs are constructive and directly adaptable as an algorithm
Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor
In this paper, we study temporal graphs arising from mobility models where
some agents move in a space and where edges appear each time two agents meet.
We propose a rather natural one-dimensional model. If each pair of agents meets
exactly once, we get a temporal clique where each possible edge appears exactly
once. By ordering the edges according to meeting times, we get a subset of the
temporal cliques. We introduce the first notion of of forbidden patterns in
temporal graphs, which leads to a characterization of this class of graphs. We
provide, thanks to classical combinatorial results, the number of such cliques
for a given number of agents. We consider specific cases where some of the
nodes are frozen, and again provide a characterization by forbidden patterns.
We give a forbidden pattern when we allow multiple crossings between agents,
and leave open the question of a characterization in this situation
A New Temporal Interpretation of Cluster Editing
The NP-complete graph problem Cluster Editing seeks to transform a static
graph into a disjoint union of cliques by making the fewest possible edits to
the edges. We introduce a natural interpretation of this problem in temporal
graphs, whose edge sets change over time. This problem is NP-complete even when
restricted to temporal graphs whose underlying graph is a path, but we obtain
two polynomial-time algorithms for restricted cases. In the static setting, it
is well-known that a graph is a disjoint union of cliques if and only if it
contains no induced copy of ; we demonstrate that no general
characterisation involving sets of at most four vertices can exist in the
temporal setting, but obtain a complete characterisation involving forbidden
configurations on at most five vertices. This characterisation gives rise to an
FPT algorithm parameterised simultaneously by the permitted number of
modifications and the lifetime of the temporal graph.Comment: 26 pages, 2 figures. Extended abstract appeared at IWOCA 202
Sharp Thresholds in Random Simple Temporal Graphs
A graph whose edges only appear at certain points in time is called a temporal graph (among other names). Such a graph is temporally connected if each ordered pair of vertices is connected by a path which traverses edges in chronological order (i.e., a temporal path). In this paper, we consider a simple model of random temporal graph, obtained from an Erd\H{o}s-R\'enyi random graph by considering a random permutation of the edges and interpreting the ranks in as presence times. Temporal reachability in this model exhibits a surprisingly regular sequence of thresholds. In particular, we show that at any fixed pair of vertices can a.a.s. reach each other; at at least one vertex (and in fact, any fixed vertex) can a.a.s. reach all others; and at all the vertices can a.a.s. reach each other, i.e., the graph is temporally connected. Furthermore, the graph admits a temporal spanner of size as soon as it becomes temporally connected, which is nearly optimal as is a lower bound. This result is significant because temporal graphs do not admit spanners of size in general (Kempe et al, STOC 2000). In fact, they do not even admit spanners of size (Axiotis et al, ICALP 2016). Thus, our result implies that the obstructions found in these works, and more generally, all non-negligible obstructions, must be statistically insignificant: nearly optimal spanners always exist in random temporal graphs. All the above thresholds are sharp. Carrying the study of temporal spanners further, we show that pivotal spanners -- i.e., spanners of size made of two spanning trees glued at a single vertex (one descending in time, the other ascending subsequently) -- exist a.a.s. at , this threshold being also sharp. Finally, we show that optimal spanners (of size ) also exist a.a.s. at
LIPIcs, Volume 244, ESA 2022, Complete Volume
LIPIcs, Volume 244, ESA 2022, Complete Volum
Input-Dynamic Distributed Algorithms for Communication Networks
Consider a distributed task where the communication network is fixed but the
local inputs given to the nodes of the distributed system may change over time.
In this work, we explore the following question: if some of the local inputs
change, can an existing solution be updated efficiently, in a dynamic and
distributed manner?
To address this question, we define the batch dynamic CONGEST model in which
we are given a bandwidth-limited communication network and a dynamic edge
labelling defines the problem input. The task is to maintain a solution to a
graph problem on the labeled graph under batch changes. We investigate, when a
batch of edge label changes arrive,
-- how much time as a function of we need to update an existing
solution, and
-- how much information the nodes have to keep in local memory between
batches in order to update the solution quickly.
Our work lays the foundations for the theory of input-dynamic distributed
network algorithms. We give a general picture of the complexity landscape in
this model, design both universal algorithms and algorithms for concrete
problems, and present a general framework for lower bounds. In particular, we
derive non-trivial upper bounds for two selected, contrasting problems:
maintaining a minimum spanning tree and detecting cliques
Finding Temporal Paths Under Waiting Time Constraints
Computing a (short) path between two vertices is one of the most fundamental primitives in graph algorithmics. In recent years, the study of paths in temporal graphs, that is, graphs where the vertex set is fixed but the edge set changes over time, gained more and more attention. A path is time-respecting, or temporal, if it uses edges with non-decreasing time stamps.
We investigate a basic constraint for temporal paths, where the time spent at each vertex must not exceed a given duration ?, referred to as ?-restless temporal paths. This constraint arises naturally in the modeling of real-world processes like packet routing in communication networks and infection transmission routes of diseases where recovery confers lasting resistance.
While finding temporal paths without waiting time restrictions is known to be doable in polynomial time, we show that the "restless variant" of this problem becomes computationally hard even in very restrictive settings. For example, it is W[1]-hard when parameterized by the feedback vertex number or the pathwidth of the underlying graph. The main question thus is whether the problem becomes tractable in some natural settings. We explore several natural parameterizations, presenting FPT algorithms for three kinds of parameters: (1) output-related parameters (here, the maximum length of the path), (2) classical parameters applied to the underlying graph (e.g., feedback edge number), and (3) a new parameter called timed feedback vertex number, which captures finer-grained temporal features of the input temporal graph, and which may be of interest beyond this work
- …