Results 51 to 60 of about 147,152 (326)
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 ...
Bannister, Michael J. +2 more
openaire +3 more sources
Parameterized Complexity of Graph Burning
Algorithmica, 2022 AbstractGraph Burning asks, given a graph $$G = (V,E)$$ G = ( V , E ) and an integer k, whether there exists $$(b_{0},\dots ,b_{k-1}) \in V^{k}$$
Yasuaki Kobayashi, Yota Otachi
openaire +5 more sources
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
Completeness Results for Parameterized Space Classes
, 2013 The parameterized complexity of a problem is considered "settled" once it has been shown to lie in FPT or to be complete for a class in the W-hierarchy or a similar parameterized hierarchy.
C.M.R. Kintala +10 more
core +1 more source
On the Average-case Complexity of Parameterized Clique [PDF]
, 2014 The k-Clique problem is a fundamental combinatorial problem that plays a prominent role in classical as well as in parameterized complexity theory. It is among the most well-known NP-complete and W[1]-complete problems.
Bollobás +22 more
core +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
The Parameterized Complexity of Graph Cyclability [PDF]
SIAM Journal on Discrete Mathematics, 2014 The cyclability of a graph is the maximum integer $k$ for which every $k$ vertices lie on a cycle. The algorithmic version of the problem, given a graph $G$ and a non-negative integer $k,$ decide whether the cyclability of $G$ is at least $k,$ is {\sf NP}-hard. We study the parametrized complexity of this problem.
Golovach, Petr A. +3 more
openaire +6 more sources
Parameterized bounded-depth Frege is not optimal [PDF]
, 2011 A general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [9]. There the authors concentrate on tree-like Parameterized Resolution-a parameterized version of classical Resolution-and their gap complexity ...
A. Haken +17 more
core +7 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
A LCCR filter based harmonic suppression method for power quality improvement
Energy Reports, 2023 As power converters have been widely used in renewable energy generation and motor drive system for the industrial production, the harmonics of output voltage of power converter will seriously affect the system power quality.
Yunhui Fang +3 more
doaj +1 more source