Results 31 to 40 of about 150,456 (276)
, 2015 In resolving instances of a computational problem, if multiple instances of interest share a feature in common, it may be fruitful to compile this feature into a format that allows for more efficient resolution, even if the compilation is relatively ...
Chen, Hubie
core +2 more sources
Parameterized Complexity of Superstring Problems [PDF]
Algorithmica, 2015 In the Shortest Superstring problem we are given a set of strings $S=\{s_1, \ldots, s_n\}$ and integer $\ell$ and the question is to decide whether there is a superstring $s$ of length at most $\ell$ containing all strings of $S$ as substrings. We obtain several parameterized algorithms and complexity results for this problem. In particular, we give an
Ivan Bliznets +5 more
openaire +2 more sources
A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy
Algorithms, 2019 We present a list of parameterized problems together with a complexity classification of whether they allow a fixed-parameter tractable reduction to SAT or not.
Ronald de Haan, Stefan Szeider
doaj +1 more source
The Parameterized Complexity of the Rainbow Subgraph Problem
Algorithms, 2015 The NP-hard RAINBOW SUBGRAPH problem, motivated from bioinformatics, is to find in an edge-colored graph a subgraph that contains each edge color exactly once and has at most \(k\) vertices.
Falk Hüffner +3 more
doaj +1 more source
Parameterized Complexity of Edge Interdiction Problems [PDF]
, 2014 We study the parameterized complexity of interdiction problems in graphs. For an optimization problem on graphs, one can formulate an interdiction problem as a game consisting of two players, namely, an interdictor and an evader, who compete on an ...
Guo, Jiong, Shrestha, Yash Raj
core +1 more source
Parameterized complexity of firefighting
Journal of Computer and System Sciences, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bazgan, Cristina +5 more
openaire +4 more sources
Algorithms, 2020 This Special Issue contains eleven articles—surveys and research papers—that represent fresh and ambitious new directions in the area of Parameterized Complexity. They provide ground-breaking research at the frontiers of knowledge, and they contribute to
Neeldhara Misra +2 more
doaj +1 more source
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
Exploring Subexponential Parameterized Complexity of Completion Problems [PDF]
, 2014 Let ${\cal F}$ be a family of graphs. In the ${\cal F}$-Completion problem, we are given a graph $G$ and an integer $k$ as input, and asked whether at most $k$ edges can be added to $G$ so that the resulting graph does not contain a graph from ${\cal F}$
Drange, Pål Grønås +3 more
core +3 more sources
Describing Parameterized Complexity Classes
Information and Computation, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Flum, Jörg, Grohe, Martin
openaire +3 more sources