We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5 k k n 2). The algorithms construct a feedback vertex set of size bounded by k (in the weighted case this set is of minimum weight among the feedback vertex set of size at most k) in a given graph G, or reports that no such a feedback vertex set exists in G.
展开▼
机译：我们在两个未加权和加权图中提出了改进的参数化算法，用于反馈顶点设置问题。这两种算法都在时间o（5 k k n 2）。算法构造由k界限的大小的反馈顶点组（在加权情况下，该组在给定图形g中的反馈顶点大多数大多数k的反馈顶点集中的最小权重），或者没有存在这样的反馈顶点集的报告在G.
展开▼
