Results 51 to 60 of about 1,615,193 (298)

Complexity of independency and cliquy trees [PDF]

, 2020
An independency (cliquy) tree of an -vertex graph is a spanning tree of in which the set of leaves induces an independent set (clique). We study the problems of minimizing or maximizing the number of leaves of such trees, and fully characterize their ...
Sánchez Villaamil, Fernando, Gobbert, Moritz, Kuinke, Philipp, Schmid, Markus L., Fernau, Henning, Casel, Katrin, Dreier, Jan, Sub Algorithms and Complexity, van Leeuwen, E.J., Algorithms and Complexity   +9 more
core   +2 more sources

Parameterized Complexity Classification for Interval Constraints [PDF]

, 2023
Constraint satisfaction problems form a nicely behaved class of problems that lends itself to complexity classification results. From the point of view of parameterized complexity, a natural task is to classify the parameterized complexity of MinCSP ...
Ordyniak, Sebastian, Jonsson, P., Dabrowski, K., Osipov, G., Dabrowski, Konrad K., Osipov, George, Sharma, Roohani, Pilipczuk, Marcin, Pilipczuk, M., Sharma, R., Ordyniak, S., Jonsson, Peter   +11 more
core   +1 more source

Taming the Chaos in Neural Network Time Series Predictions

Entropy, 2021
Machine learning methods, such as Long Short-Term Memory (LSTM) neural networks can predict real-life time series data. Here, we present a new approach to predict time series data combining interpolation techniques, randomly parameterized LSTM neural ...
Sebastian Raubitzek, Thomas Neubauer
doaj   +1 more source

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

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

09511 Abstracts Collection – Parameterized complexity and approximation algorithms [PDF]

, 2010
From 14. 12. 2009 to 17. 12. 2009., the Dagstuhl Seminar 09511 ``Parameterized complexity and approximation algorithms '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics.
Marx, Dániel, Hajiaghayi, MohammadTaghi, Demaine, Erik D.   +2 more
core   +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, Christian Komusiewicz, Rolf Niedermeier, Martin Rötzschke   +3 more
doaj   +1 more source

On the Parameterized Complexity of Pooling Design [PDF]

Journal of Computational Biology, 2009
Pooling design is a very helpful tool for reducing the number of tests in DNA library screening, which is a key process to obtain high-quality DNA libraries for studying gene functions. Three basic problems in pooling design are, given an m x n binary matrix and a positive integer d, to decide whether the matrix is d-separable (d-separable, or d ...
Yongxi Cheng, Ding-Zhu Du, Ker-I Ko, Guohui Lin   +3 more
openaire   +2 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   +6 more sources

On the parameterized complexity of red-blue points separation

Journal of Computational Geometry, 2019
We study the following geometric separation problem: Given a set $\mathcal R$ of red points and a set $\mathcal B$ of blue points in the plane, find a minimum-size set of lines that separate $\mathcal R$ from $\mathcal B$.
Edouard Bonnet, Panos Giannopoulos, Michael Lampis   +2 more
doaj   +1 more source