Fixed-Parameter Tractable (FPT)
Hitting topological minor models in planar graphs is fixed parameter tractable
... deletion of k vertices. In other words, the class P represents some desired property that we want to impose to the input graph after deleting k vertices. This is a general graph modification problem with great expressive ...
35
Fixed-parameter tractable sampling for RNA design with multiple target structures
... any fixed value of the treewidth, the complexity scales only linearly with the size of designed sequences and the number of targeted structures, ...are fixed-parameter tractable ...practice) ...
21
A linear fixed parameter tractable algorithm for connected pathwidth
... graph parameter of pathwidth can be seen as a measure of the topological resemblance of a graph to a ...is fixed parameter tractable, in particular we design a 2 O(k 2 ) · n time algorithm ...
17
Constructing Minimal Phylogenetic Networks from Softwired Clusters is Fixed Parameter Tractable
... the parameter is no longer allowed to appear in the exponent of |X | as it was in ...and fixed parameter tractable in a practical, as opposed to solely theoretical sense [1, 2, 5, ...
32
Fixed-Parameter Tractable Sampling for RNA Design with Multiple Target Structures
... Results: We revisit a central ingredient of most in-silico design methods: the sampling of sequences for the design of multi-target structures, possibly including pseudoknots. For this task, we present the efficient, ...
29
Constant Thresholds Can Make Target Set Selection Tractable
... the parameter (usually a positive ...called fixed-parameter tractable (fpt) with respect to a parameter k if it can be solved in f (k) · s O(1) time, where f is a computable function ...
23
On the fixed parameter tractability of agreement-based phylogenetic distances
... also fixed-parameter tractable in their respective natural ...a parameter (here the hybridiza- tion number and rSPR/TBR distance, respectively) is small, the problem can be solved efficiently ...
21
Fixed-Parameter Algorithms For Protein Similarity Search Under mRNA Structure Constraints
... Corollary 2. MRSO is solvable in O(2 12δ n) time. 3.1 Implied structure graphs with page-number two In light of algorithm A NEB and Lemma 1, a natural question to ask is whether MRSO is polynomial- time solvable in case ...
14
On Backdoors To Tractable Constraint Languages
... given tractable class T , ...is fixed-parameter tractable with respect to the backdoor size ...semantic tractable class of CSP, in the same spirit as a very recent work by Gaspers et ...
17
Fixed-point-like theorems on subspaces
... [12] Hirsch, M., Magill, M., Mas-Colell, A., A geometric approach to a class of equilibrium existence theorems, Journal of Mathematical Economics 19, (1990) 95-106. [13] Husseini, S. Y., Lasry, J.M., Magill, M., ...
14
Finding Repeats With Fixed Gap
... Unité de recherche INRIA Lorraine LORIA, Technopôle de Nancy-Brabois - Campus scientifique 615, rue du Jardin Botanique - BP 101 - 54602 Villers-lès-Nancy Cedex France Unité de recherche[r] ...
19
Fixed-point-like theorems on subspaces
... a fixed-point-like theorem for multivalued mappings defined on the finite Cartesian product of Grassmannian manifolds and convex ...classical fixed-point theorems as Brouwer’s [ 2 ], Kakutani’s [ 14 ], or ...
14
Cosmological Parameter Estimation: Method
... In this way, we may write Eq. 3 in terms of the band–power and treat the latter as a parameter to be estimated. This then becomes the band–power likelihood function, L(δT fb ). Figure 1 shows the latest band power ...
12
On Homogeneous Distributed Parameter Systems
... where H and V are scalar functions of time and space variables. The quantity H(t, x) is the water level at the instant of time t ∈ R + in the point x ∈ R, and V (t, x) is the water velocity in the same position. The ...
7
Automated MOSFET parameter extraction
... After the test files are inserted and read by the newanal program, the program will first calculate the threshold voltage using maximum slope method (described in section 5.1), the [r] ...
78
On fixed-point hardware polynomials
... The reason for normalizing functions to unit intervals is that it greatly simplifies the arithmetic analysis needed to build an efficient architecture. This is indeed at the core of the contributions of this article. In ...
6
Parametrizations, fixed and random effects
... positive parameter. We introduce the notion of bases separating the fixed and random effects and define comparison criteria between two separating bases using the partition functions and the maximum ...
26
Predicting the Best System Parameter Configuration: the (Per Parameter Learning) PPL method
... After indexing, the next step is to generate the set of K system configurations including the various values of the considered parameters in P. If all the possible configurations were generated, the chance of getting the ...
11
Tractable sufficient stability conditions for a system coupling linear transport and differential equations
... m i ). This explains the term in e −2δxΛ −1 in functional (3). This functional is inspired by the complete Lyapunov-Krasovskii func- tional from [16] which is a necessary and sufficient condition for stability of linear ...
21
Some tractable instances of interval data minmax regret problems: bounded distance from triviality
... [7] H. L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. on Computing, 25(6):1305–1317, 1996. [8] R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, ...
12