Fixed Parameter Tractable (FPT)
Faster Fixed Parameter Tractable Algorithms for Finding Feedback Vertex Sets
... integer parameter k, whether G has a set of at most k vertices whose removal results in an acyclic ...efficient fixed parameter algorithms whose worst-case time complexity is bounded by functions of ...
13
Constructing Minimal Phylogenetic Networks from Softwired Clusters is Fixed Parameter Tractable
... We will subsequently use the term lowest side to denote an unfinished long side such that there is no other unfinished long side s 0 6= s that is reachable from s. The following lemma is basically the fixed ...
32
Minimum bisection is fixed parameter tractable
... In the classic Minimum Bisection problem we are given as input a graph G and an integer k. The task is to determine whether there is a partition of V (G) into two parts A and B such that ||A| − |B|| ≤ 1 and there are at ...
11
Minimum Bisection is fixed parameter tractable
... This is the first fixed parameter tractable algorithm for Minimum Bisection. At the core of our algorithm lies a new decomposition theorem that states that every graph G can be decomposed by small ...
30
Subset feedback vertex set is fixed parameter tractable
... is fixed parameter tractable Marek Cygan Marcin Pilipczuk Michał Pilipczuk Jakub Onufry Wojtaszczyk ∗ Abstract The F EEDBACK V ERTEX S ET problem, given an undirected graph G and an integer k, asks ...
19
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
... new fixed-parameter tractable algorithms and insights into the relationship between transformations of graph classes and effective characterizations of those ...
17
Fixed parameter tractable canonization and isomorphism test for graphs of bounded treewidth
... Prior to this work very little was known about such improvements. In particular, the existence of FPT algorithms for Graph Isomorphism parameterized by maximum degree, genus or treewidth of the input graph have remained ...
31
Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable
... of the intermediate graphs obtained by applying the graph edit sequence to satisfy a certain property π, is in FPT for the parameter ∆ + `. Moreover, we show that both the problems are NP-complete. Since the NDL ...
91
Fixed-Parameter Tractable Distances to Sparse Graph Classes
... Abstract We show that for various classes C of sparse graphs, and several measures of distance to such classes such as edit distance and elimination distance, the problem of determining [r] ...
20
Fixed parameter algorithms for compatible and agreement supertree problems
... 5.4 Solving the AST-EC and AST-TR Problems In this section we show that both the AST-EC and AST-TR problems are fixed-parameter tractable for parameters k and p. Our two algorithms build upon the ...
130
Fixed parameter tractability of multicut in directed acyclic graphs
... the parameter . Formally, we say that a problem is fixed-parameter tractable (FPT) if it can be solved by an algorithm that runs in time f ( k ) n c for n being the length of the input and k ...
24
Fixed parameter tractability of multicut parameterized by the size of the cutset
... 6 Hardness of Directed Multicut We prove that Directed Edge Multicut is W[1]-hard parameterized by the solution size, thus it is not fixed-parameter tractable (assuming the widely-held complexity ...
31
Polynomial fixed-parameter algorithms : a case study for longest path on interval graphs.
... (Polynomial Fixed-Parameter Tractable), containing the problems solvable in O(k t · p(n)) time for some constant t ≥ 1, ...the parameter k is at most ...(Polynomial-Linear ...
13
On the fixed parameter tractability of agreement-based phylogenetic distances.
... is fixed-parameter tractable when parameterized by the hybridization number [5] but our result is stronger as the hybridization level can be small, even 1, for pairs of trees for which the ...
21
Fixed parameter algorithms for one-sided crossing minimization revisited
... Whitesides, An efficient fixed parameter tractable algorithm for 1-sided crossing minimization, Algorithmica 40 2004 15–31] and derive an O1.4656k + kn2 algorithm for this problem, wher[r] ...
11
Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual
... first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge ...is fixed-parameter tractable and has a ...
12
On Limited Conjunctions and Partial Features in Parameter-Tractable Feature Logics
... The contributions in this paper are twofold. First, we intro- duce CF DI ∀− kc , a new dialect of the CF D family of DLs admitting a limited use of concept conjunction in left-hand sides of TBox subsumption while ...
8
Invitation to Fixed-Parameter Algorithms
... 3.2 Analyzing Search Tree Sizes To analyze the sizes of the presented search trees for Vertex Cover, 3- Hitting Set, and Independent Set on planar graphs was straightforward. There, we branched into either two, three, or ...
168
Tractable Bayesian Optimal Policy in the Presence of Regime Change and Local Parameter Uncertainty
... http://www.ericswanson.pro Abstract This paper proposes an approximation to the optimal policy problem in forward-looking models with regime change that allows for tractable solu- tion for the optimal policy even ...
20
Fixed-parameter algorithms for Kemeny rankings
... the parameter average range instead of maximum range, Kemeny Score turns NP-complete already for constant parameter ...achieve fixed-parameter tractability when replacing the ‘‘range measure’’ ...
17