Feedback Edge Sets in Temporal Graphs

Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations


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.

Original languageEnglish
Title of host publicationGraph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Revised Selected Papers
EditorsIsolde Adler, Haiko Müller
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages13
ISBN (Print)9783030604394
StatePublished - 1 Jan 2020
Externally publishedYes
Event46th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2020 - Leeds, United Kingdom
Duration: 24 Jun 202026 Jun 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12301 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference46th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2020
Country/TerritoryUnited Kingdom

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Feedback Edge Sets in Temporal Graphs'. Together they form a unique fingerprint.

Cite this