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.
@article{arxiv.2003.13641,
title = {Feedback Edge Sets in Temporal Graphs},
author = {Roman Haag and Hendrik Molter and Rolf Niedermeier and Malte Renken},
journal= {arXiv preprint arXiv:2003.13641},
year = {2021}
}