论文标题
时间图中的反馈边缘集
Feedback Edge Sets in Temporal Graphs
论文作者
论文摘要
经典的，线性的可解决的反馈边缘设置问题涉及找到最小数量的边缘，该边缘与（静态，未加权）图中的所有周期相交。我们在时间图的环境中对此问题进行了首次研究，其中仅在某些时间点存在边缘。我们发现，反馈边缘集有四个天然概括，所有这些都是NP-HARD。我们还研究了这些问题在几个参数（解决方案大小，寿命和图形顶点的数量等）方面的障碍性，并获得了一些参数化的硬度，但还获得了固定参数的障碍性结果。
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.
