Results 51 to 60 of about 128,668 (237)
Parameterized Complexity of Firefighting Revisited [PDF]
, 2012 The Firefighter problem is to place firefighters on the vertices of a graph to prevent a fire with known starting point from lighting up the entire graph. In each time step, a firefighter may be permanently placed on an unburned vertex and the fire spreads to its neighborhood in the graph in so far no firefighters are protecting those vertices.
Marek Cygan +2 more
openaire +4 more sources
parameterized complexity of pca
, 2020 We discuss some recent progress in the study of Principal Component Analysis (PCA) from the perspective of Parameterized Complexity.
Fomin, Fedor +2 more
openaire +4 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
The Turing way to parameterized complexity [PDF]
Journal of Computer and System Sciences, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 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 +3 more sources
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 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