The Complexity of Transitively Orienting Temporal Graphs

by   George B. Mertzios, et al.

In a temporal network with discrete time-labels on its edges, entities and information can only "flow" along sequences of edges whose time-labels are non-decreasing (resp. increasing), i.e. along temporal (resp. strict temporal) paths. Nevertheless, in the model for temporal networks of [Kempe et al., JCSS, 2002], the individual time-labeled edges remain undirected: an edge e={u,v} with time-label t specifies that "u communicates with v at time t". This is a symmetric relation between u and v, and it can be interpreted that the information can flow in either direction. In this paper we make a first attempt to understand how the direction of information flow on one edge can impact the direction of information flow on other edges. More specifically, we introduce the notion of a temporal transitive orientation and we systematically investigate its algorithmic behavior in various situations. An orientation of a temporal graph is called temporally transitive if, whenever u has a directed edge towards v with time-label t_1 and v has a directed edge towards w with time-label t_2≥ t_1, then u also has a directed edge towards w with some time-label t_3≥ t_2. If we just demand that this implication holds whenever t_2 > t_1, the orientation is called strictly temporally transitive. Our main result is a conceptually simple, yet technically quite involved, polynomial-time algorithm for recognizing whether a given temporal graph 𝒢 is transitively orientable. In wide contrast we prove that, surprisingly, it is NP-hard to recognize whether 𝒢 is strictly transitively orientable. Additionally we introduce and investigate further related problems to temporal transitivity, notably among them the temporal transitive completion problem, for which we prove both algorithmic and hardness results.


page 3

page 5

page 11

page 15

page 23

page 25

page 29

page 31


Planar Steiner Orientation is NP-complete

Many applications in graph theory are motivated by routing or flow probl...

The complexity of computing optimum labelings for temporal connectivity

A graph is temporally connected if there exists a strict temporal path, ...

The Complexity of Debt Swapping

A debt swap is an elementary edge swap in a directed, weighted graph, wh...

The Computational Complexity of Finding Separators in Temporal Graphs

Vertex separators, that is, vertex sets whose deletion disconnects two d...

Target Location Problem for Multi-commodity Flow

Motivated by scheduling in Geo-distributed data analysis, we propose a t...

Edge exploration of temporal graphs

We introduce a natural temporal analogue of Eulerian circuits and prove ...

Directed hypergraph connectivity augmentation by hyperarc reorientations

The orientation theorem of Nash-Williams states that an undirected graph...

Please sign up or login with your details

Forgot password? Click here to reset