Results 51 to 60 of about 2,051,541 (361)

On the parameterized complexity of computing tree-partitions [PDF]

Discrete Mathematics & Theoretical Computer Science
We study the parameterized complexity of computing the tree-partition-width, a graph parameter equivalent to treewidth on graphs of bounded maximum degree.
Hans L. Bodlaender, Carla Groenland, Hugo Jacob   +2 more
doaj   +1 more source

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, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh   +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

Parameterized Complexity of Critical Node Cuts [PDF]

, 2015
We consider the following natural graph cut problem called Critical Node Cut (CNC): Given a graph $G$ on $n$ vertices, and two positive integers $k$ and $x$, determine whether $G$ has a set of $k$ vertices whose removal leaves $G$ with at most $x ...
Hermelin, Danny, Kaspi, Moshe, Komusiewicz, Christian, Navon, Barak   +3 more
core   +2 more sources

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, Christian Komusiewicz, Rolf Niedermeier, Martin Rötzschke   +3 more
doaj   +1 more source

Special Issue “New Frontiers in Parameterized Complexity and Algorithms”: Foreward by the Guest Editors

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, Frances Rosamond, Meirav Zehavi   +2 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, D.S. Johnson, N. Creignou, N. Creignou, P. Damaschke, S. Khuller, S. Kratsch, S. Szeider   +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, Chopin, Morgan, Cygan, Marek, Fellows, Michael R., Fomin, Fedor V., van Leeuwen, Erik Jan   +5 more
openaire   +4 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

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