时态图的反馈边集
Feedback Edge Sets in Temporal Graphs
摘要:
经典的,线性时间可解的反馈边集问题是关于在一个(静态的,未加权的)图中找到与所有圈相交的最少数量的边。我们提供了第一个研究这个问题的时间图,其中边缘只存在于某些时间点的设置。我们发现反馈边集有四种自然的推广,它们都是NP难的。我们还研究了这些问题的易处理性方面的几个参数(解决方案的大小,寿命,图顶点数,等等),并获得一些参数化的硬度,但也固定参数易处理性的结果。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。