Parameterized complexity of the problem
Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
... problem becomes fixed-parameter ...the problem for graphs of bounded degree, of bounded degeneracy, of bounded chromatic number, in all proper minor-closed graph classes (which includes, in particular, ...
7
On parameterized complexity of the Multi-MCS problem
... subgraph problem for multiple graphs (Multi-MCS) inspired by various biological applications such as multiple alignments of gene sequences, protein structures, metabolic pathways, or protein–protein interaction ...
9
The Parameterized Complexity of the Survivable Network Design Problem
... of G i . Such a tree can be computed using an FPT algorithm for Steiner Tree parameterized by the number of terminals (e.g., using the Dreyfus and Wagner [26] algorithm). The union of these Steiner trees is the ...
20
ON PARAMETERIZED COMPLEXITY OF HITTING SET PROBLEM FOR AXIS–PARALLEL SQUARES INTERSECTING A STRAIGHT LINE
... the problem can be solved to optimality in polynomial time for any fixed range of ...the complexity status of the con- sidered problem in the case, where this parameter is ...Set Problem for ...
10
Parameterized complexity of DPLL search procedures
... of parameterized DPLL ...the parameterized pigeonhole principle and to the ordering ...the problem of deciding whether a graph has a small ...
15
Parameterized Complexity of Fixed Variable Logics
... the parameterized approaches towards mirroring the behavior of PSPACE have proven to be useful to classify a large number of problems, some problems remained unclassified and, hence, not well ...are ...
12
Parameterized complexity of DPLL search procedures
... fixed parameterized tractable refutations in dag-like Resolution, but not in ...open problem it remains whether this is the case also for the random graphs ...
24
Parameterized complexity of Eulerian deletion problems
... Theorem 3 The U NDIRECTED and D IRECTED E ULERIAN E DGE D ELETION prob- lems are NP-hard, even when restricted to inputs (G, k) where G is a planar (di- rected) graph with maximum degree at most 3, and k = | E(G) | . In ...
22
On the Parameterized Complexity of Contraction to Generalization of Trees
... -Editing problem takes as an input a graph G and an integer k, and the goal is to decide whether or not we can obtain a graph in F by applying at most k edit operations on ...-Editing problem, where the ...
12
Parameterized Complexity of (A, l)-path Packing
... ∧ ∀e ∈ F (e / ∈ C =⇒ ¬connected(C ∪ {e})). D Omitted proofs in Section 5 The input of Circuit SAT is a Boolean circuit with a number of inputs and one output. The question is whether the circuit can output true by ...
25
The Parameterized Complexity of Short Computation and Factorization
... the problem of Weighted SAT for any formula not just one in 3CN F ...differing parameterized complexity and form only parts of a hierarchy as we see ...
13
On the parameterized complexity of (k,s)-SAT.
... Keywords: satisfiability, (k, s)-formulas, fixed-parameter tractability 1 Introduction In this note we consider some special variant of the Satisfiability problem from a parameterized point of view. In ...
5
The parameterized complexity of maximality and minimality problems
... Many parameterized problems (such as the clique problem and the dominating set problem) ask, given an instance and a natural number k as parameter, whether there is a solution of size ...the ...
40
Parameterized Complexity of Graph Constraint Logic
... a problem is bandwidth-preserving in the sense that the bandwidth of the resulting graph only depends on the bandwidth of the original constraint graph, then that problem remains PSPACE-hard even when ...
12
Parameterized complexity of Eulerian deletion problems
... edge-deletion problem thoroughly from the pa- rameterized point of view: we present a fixed-parameter tractable algorithm for both cases where the parameter is the number of deletions allowed (Theorem 4 ), and ...
21
On the Parameterized Complexity of Red-Blue Points Separation
... tion parameterized by min{|R|, ...general problem in the previous section suggests, the difficult cases seem to be the ones where R and B are (more or less) balanced in ...the complexity of ...
27
On the Parameterized Complexity of Red-Blue Points Separation
... separation problem: Given a set R of red points and a set B of blue points in the plane, find a minimum-size set of lines that separate R from ...generality, parameterized by the number of lines k in the ...
13
MoL 2015 01: Structural Parameterized Complexity
... of parameterized complexity in Section ...to parameterized complexity are in Section 6 and Section ...descriptive complexity theory which reflects the interpretation of the parameter as ...
50
Parameterized complexity and polynomial-time approximation schemes
... using parameterized complexity ...the parameterized class FPT is worth ...the problem is in APX if and only if the corresponding parameterized problem is in ...well-known ...
155
Parameterized complexity of even/odd subgraph problems
... the problem is equivalent to whether we can delete k edges E from the input G to obtain a graph where every nonisolated vertex has an odd ...the problem to have a solution, and therefore we only need to ...
10