منابع مشابه
An FPT Algorithm for Tree Deletion Set
We give a 5n time fixed-parameter algorithm for determining whether a given undirected graph on n vertices has a subset of at most k vertices whose deletion results in a tree. Such a subset is a restricted form of a feedback vertex set. While parameterized complexity of feedback vertex set problem and several of its variations have been well studied, to the best of our knowledge, this is the fi...
متن کاملAn FPT Algorithm for Set Splitting
An FPT algorithm with a running time of O(n+2n) is described for the Set Splitting problem, parameterized by the number k of sets to be split. It is also shown that there can be no FPT algorithm for this problem with a running time of the form 2n unless the satisfiability of n-variable 3SAT instances can be decided in time 2.
متن کاملAn FPT algorithm for edge subset feedback edge set
Given a graph G = (V,E) with a subset S ⊆ E of edges, the edge subset feedback edge set problem is to find a smallest set F of edges such that in G′ = (V,E − F ) no cycle contains an edge in S. We also define a restricted version of this problem, in which no edges in S is allowed to be selected into F to form a solution. In this paper, we give a linear-time algorithm for the edge subset feedbac...
متن کاملAn improved FPT algorithm for Independent Feedback Vertex Set
We study the Independent Feedback Vertex Set problem — a variant of the classic Feedback Vertex Set problem where, given a graph G and an integer k, the problem is to decide whether there exists a vertex set S ⊆ V (G) such that G \ S is a forest and S is an independent set of size at most k. We present an O∗((1 +φ))-time FPT algorithm for this problem, where φ < 1.619 is the golden ratio, impro...
متن کاملAn O∗(2O(k)) FPT Algorithm for the Undirected Feedback Vertex Set Problem∗
We describe an algorithm for the FEEDBACK VERTEX SET problem on undirected graphs, parameterized by the size k of the feedback vertex set, that runs in time O(ckn3) where c = 10.567 and n is the number of vertices in the graph. This improves on the best previous FPT algorithms due to [RSS02, KPS04] and [RS05] that have running times of the form O ∗(2O(k lg lg ) and O∗(2O(k lg k lg lg k ), respe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2013
ISSN: 1526-1719
DOI: 10.7155/jgaa.00308