Feedback Edge Sets in Temporal Graphs

by   Roman Haag, et al.

The classical, linear-time solvable Feedback Edge Set problem is concerned with finding a minimum number of edges intersecting all cycles in a (static, unweighted) graph. We provide a first study of this problem in the setting of temporal graphs, where edges are present only at certain points in time. We find that there are four natural generalizations of Feedback Edge Set, all of which turn out to be NP-hard. We also study the tractability of these problems with respect to several parameters (solution size, lifetime, and number of graph vertices, among others) and obtain some parameterized hardness but also fixed-parameter tractability results.


page 1

page 2

page 3

page 4


On Finding Separators in Temporal Split and Permutation Graphs

Removing all connections between two vertices s and z in a graph by remo...

Edge exploration of temporal graphs

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

Recurrent segmentation meets block models in temporal networks

A popular approach to model interactions is to represent them as a netwo...

Deleting edges to restrict the size of an epidemic in temporal networks

A variety of potentially disease-spreading contact networks can be natur...

Dispersing obnoxious facilities on a graph

We study a continuous facility location problem on a graph where all edg...

Placing Green Bridges Optimally, with Habitats Inducing Cycles

Choosing the placement of wildlife crossings (i.e., green bridges) to re...

How fast can we reach a target vertex in stochastic temporal graphs?

Temporal graphs are used to abstractly model real-life networks that are...