Results 61 to 70 of about 23,779 (205)
Parameterized Complexity Results for Bayesian Inference
, 2022 We present completeness results for inference in Bayesian networks with respect to two different parameterizations, namely the number of variables and the topological vertex separation number.
Donselaar, Nils +2 more
core +1 more source
Parameterized Complexity of 1-Planarity [PDF]
Journal of Graph Algorithms and Applications, 2013 We consider the problem of drawing graphs with at most one crossing per edge. These drawings, and the graphs that can be drawn in this way, are called $1$-planar. Finding $1$-planar drawings is known to be ${\mathsf{NP}}$-hard, but we prove that it is fixed-parameter tractable with respect to the vertex cover number, tree-depth, and cyclomatic number ...
Michael J. Bannister +2 more
openaire +3 more sources
Integer Programming in Parameterized Complexity: Three Miniatures [PDF]
, 2019 Powerful results from the theory of integer programming have recently led to substantial advances in parameterized complexity. However, our perception is that, except for Lenstra's algorithm for solving integer linear programming in fixed dimension ...
Koutecký, Martin +2 more
core +1 more source
On the Parameterized Complexity of Reconfiguration Problems [PDF]
Algorithmica, 2013 We present the first results on the parameterized complexity of reconfiguration problems, where a reconfiguration version of an optimization problem $Q$ takes as input two feasible solutions $S$ and $T$ and determines if there is a sequence of {\em reconfiguration steps} that can be applied to transform $S$ into $T$ such that each step results in a ...
Amer E. Mouawad +4 more
openaire +2 more sources
Algorithms, 2013 We suggest a user-oriented approach to combinatorial data anonymization. A data matrix is called k-anonymous if every row appears at least k times—the goal of the NP-hard k-ANONYMITY problem then is to make a given matrix k-anonymous by suppressing ...
Rolf Niedermeier +2 more
doaj +1 more source
On the Parameterized Complexity of Symmetric Directed Multicut [PDF]
, 2022 We study the problem Symmetric Directed Multicut from a parameterized complexity perspective. In this problem, the input is a digraph D, a set of cut requests C = {(s₁,t₁),…,(s_l,t_l)} and an integer k, and the task is to find a set X ⊆ V(D) of size at ...
Eiben, Eduard +2 more
core +1 more source
Existential Second-Order Logic over Graphs: Parameterized Complexity [PDF]
, 2023 By Fagin’s Theorem, NP contains precisely those problems that can be described by formulas starting with an existential second-order quantifier, followed by only first-order quantifiers (eso formulas). Subsequent research refined this result, culminating
Bannach, Max +2 more
core +1 more source
Theorietage der Gesellschaft für Informatik in Speyer 2015—Special Issue
Algorithms, 2016 We briefly report on the national workshops on Formal Languages and Automata Theory as well as on Algorithms and Complexity Theory held in early Autumn, 2015.
Henning Fernau
doaj +1 more source
The Parameterized Complexity of the Equidomination Problem [PDF]
, 2017 A graph $G=(V,E)$ is called equidominating if there exists a value $t \in \mathbb{N}$ and a weight function $ω: V \rightarrow \mathbb{N}$ such that the total weight of a subset $D\subseteq V$ is equal to $t$ if and only if $D$ is a minimal dominating set.
Oliver Schaudt, Fabian Senger
openaire +2 more sources
Parameterized Complexity of Safe Set [PDF]
Journal of Graph Algorithms and Applications, 2019 In this paper we study the problem of finding a small safe set $S$ in a graph $G$, i.e., a non-empty set of vertices such that no connected component of $G[S]$ is adjacent to a larger component in $G - S$. We enhance our understanding of the problem from the viewpoint of parameterized complexity by showing that (1) the problem is W[2]-hard when ...
Rémy Belmonte +5 more
openaire +2 more sources