TY - GEN
T1 - Feedback Edge Sets in Temporal Graphs
AU - Haag, Roman
AU - Molter, Hendrik
AU - Niedermeier, Rolf
AU - Renken, Malte
N1 - Publisher Copyright:
© 2020, Springer Nature Switzerland AG.
PY - 2020/1/1
Y1 - 2020/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85093820004&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-60440-0_16
DO - 10.1007/978-3-030-60440-0_16
M3 - Conference contribution
AN - SCOPUS:85093820004
SN - 9783030604394
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 200
EP - 212
BT - Graph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Revised Selected Papers
A2 - Adler, Isolde
A2 - Müller, Haiko
PB - Springer Science and Business Media Deutschland GmbH
T2 - 46th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2020
Y2 - 24 June 2020 through 26 June 2020
ER -