Results 1  10
of
239,024
Directed Feedback Vertex Set is FixedParameter Tractable
"... Abstract. We resolve positively a long standing open question regarding the fixedparameter tractability of the parameterized Directed Feedback Vertex Set problem. In particular, we propose an algorithm which solves this problem in O(8 k k! ∗ poly(n)). Keywords. Directed Feedback Vertex Set, Fixed ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We resolve positively a long standing open question regarding the fixedparameter tractability of the parameterized Directed Feedback Vertex Set problem. In particular, we propose an algorithm which solves this problem in O(8 k k! ∗ poly(n)). Keywords. Directed Feedback Vertex Set, FixedParameter
Fixedparameter tractability and completeness
, 1992
"... For many fixedparameter problems that are trivially solvable in polynomialtime, such as kDominating Set, essentially no better algorithm is presently known than the one which tries all possible solutions. Other problems, such as kFeedback Vertex Set, exhibit fixedparameter tractability: for eac ..."
Abstract

Cited by 53 (6 self)
 Add to MetaCart
For many fixedparameter problems that are trivially solvable in polynomialtime, such as kDominating Set, essentially no better algorithm is presently known than the one which tries all possible solutions. Other problems, such as kFeedback Vertex Set, exhibit fixedparameter tractability
Subset feedback vertex set is fixedparameter tractable
, 2011
"... The classical FEEDBACK VERTEX SET problem asks, for a given undirected graph G and an integer k, to find a set of at most k vertices that hits all the cycles in the graph G. FEEDBACK VERTEX SET has attracted a large amount of research in the parameterized setting, and subsequent kernelization and fi ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
of S bounded by O(k 3), using kernelization techniques such as the 2Expansion Lemma, Menger’s theorem and Gallai’s theorem. These two facts allow us to give a 2 O(k log k) n O(1) time algorithm solving the SUBSET FEEDBACK VERTEX SET problem, proving that it is indeed fixedparameter tractable.
Graph isomorphism parameterized by feedback vertex set number is fixedparameter
, 2009
"... tractable ..."
Fixedparameter
"... tractable canonization and isomorphism test for graphs of bounded treewidth∗ ..."
Abstract
 Add to MetaCart
tractable canonization and isomorphism test for graphs of bounded treewidth∗
Fixedparameter
"... tractable canonization and isomorphism test for graphs of bounded treewidth∗ ..."
Abstract
 Add to MetaCart
tractable canonization and isomorphism test for graphs of bounded treewidth∗
Fixedparameter tractability and logic
 In preparation
, 1999
"... We exhibit a close connection between parameterized complexity theory and logic. Our approach is that of descriptive complexity theory. We study the definability of parameterized problems and try to obtain information about the parameterized complexity of the problems through the syntactical structu ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
structure of the defining sentences. On the one hand, we use this approach to prove that certain problems are fixedparameter tractable because they can be defined by syntactically simple formulas. On the other hand, we characterize classes of intractable problems by syntactical means. 1
DIRECTED GRAPHS: FIXEDPARAMETER TRACTABILITY & BEYOND
, 2014
"... Most interesting optimization problems on graphs are NPhard, implying that (unless P = NP) there is no polynomial time algorithm that solves all the instances of an NPhard problem exactly. However, classical complexity measures the running time as a function of only the overall input size. The pa ..."
Abstract
 Add to MetaCart
plexity is to design efficient algorithms for NPhard problems when the parameter k is small, even if the input size is large. Formally, we say that a parameterized problem is fixedparameter tractable (FPT) if instances of size n and parameter k can be solved in f (k) · nO(1) time, where f is a computable function
Results 1  10
of
239,024