Results 31 to 40 of about 149,306 (281)
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
Paradigms for Parameterized Enumeration [PDF]
, 2013 The aim of the paper is to examine the computational complexity and algorithmics of enumeration, the task to output all solutions of a given problem, from the point of view of parameterized complexity.
D. Marx +7 more
core +2 more sources
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
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
The Burning Number of Directed Graphs: Bounds and Computational Complexity
Theory and Applications of Graphs, 2020 The burning number of a graph was recently introduced by Bonato et al. Although they mention that the burning number generalizes naturally to directed graphs, no further research on this has been done. Here, we introduce graph burning for directed graphs,
Remie Janssen
doaj +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 ...
Bannister, Michael J. +2 more
openaire +3 more sources