Results 71 to 80 of about 2,616,817 (282)
Fixed-parameter tractability and completeness II: On completeness for W[1] [PDF]
For many fixed-parameter problems that are trivially solvable in polynomial-time, such as k-DOMINATING SET, essentially no better algorithm is presently known than the one which tries all possible solutions.
Downey, Rod G., Fellows, Michael R.
core +1 more source
Semantic width and the fixed-parameter tractability of constraint satisfaction problems [PDF]
Constraint satisfaction problems (CSPs) are an important formal framework for the uniform treatment of various prominent AI tasks, e.g., coloring or scheduling problems. Solving CSPs is, in general, known to be NP-complete and fixed-parameter intractable
Hubie Chen +7 more
core +1 more source
Hitting long directed cycles is fixed-parameter tractable
In the Directed Long Cycle Hitting Set} problem we are given a directed graph $G$, and the task is to find a set $S$ of at most $k$ vertices/arcs such that $G-S$ has no cycle of length longer than $\ell$. We show that the problem can be solved in time $2^{\mathcal O(\ell k^3\log k + k^5\log k\log\ell)}\cdot n^{\mathcal O(1)}$, that is, it is fixed ...
Alexander Göke +2 more
openaire +7 more sources
A gas‐fed, zero‐gap, PEM CO2 electrolyzer is realized by incorporating PDDA+ ions onto the carbonaceous Co/N‐C electrocatalyst, with gaseous H2 and CO2 fed into the anode and cathode, respectively. Operating without an aqueous electrolyte, the system sustains a peak FECO of 65.1% at 100 mA cm−2. ABSTRACT Electrochemical carbon dioxide reduction (ECO2R)
Yuen Leong Chow +6 more
wiley +1 more source
Backtracking-based dynamic programming for resolving transmit ambiguities in WSN localization
The complexity of agent localization increases significantly when unique identification of the agents is not possible. Corresponding application cases include multiple-source localization, in which the agents do not have identification sequences at all ...
Stephan Schlupkothen +2 more
doaj +1 more source
Fixed-parameter tractability results for feedback set problems in tournaments
. Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed-parameter tractability results for these problems.
Anke Truß +4 more
core +1 more source
Testing first-order properties for subclasses of sparse graphs [PDF]
We present a linear-time algorithm for deciding first-order (FO) properties in classes of graphs with bounded expansion, a notion recently introduced by Nešetřil and Ossona de Mendez.
Thomas, Robin +2 more
core +1 more source
Unit Interval Editing is Fixed-Parameter Tractable [PDF]
Given a graph~$G$ and integers $k_1$, $k_2$, and~$k_3$, the unit interval editing problem asks whether $G$ can be transformed into a unit interval graph by at most $k_1$ vertex deletions, $k_2$ edge deletions, and $k_3$ edge additions. We give an algorithm solving this problem in time $2^{O(k\log k)}\cdot (n+m)$, where $k := k_1 + k_2 + k_3$, and $n, m$
openaire +4 more sources
Fixed-Parameter Tractable Distances to Sparse Graph Classes [PDF]
We show that for various classes C$$\mathcal {C}$$ of sparse graphs, and several measures of distance to such classes (such as edit distance and elimination distance), the problem of determining the distance of a given graph G to C$$\mathcal {C}$$ is fixed-parameter tractable. The results are based on two general techniques.
Jannis Bulian, Anuj Dawar
openaire +6 more sources
Autonomous scanning probe microscopy and multi‐objective Bayesian optimization navigate a ternary (Al,Sc,B)N combinatorial library. Registered photoluminescence, electron‐probe compositional mapping, and X‐ray diffraction connect local electromechanical function to defect‐sensitive emission, composition, and crystal structure.
Yu Liu +12 more
wiley +1 more source

