Results 31 to 40 of about 19,138 (262)
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
The Parameterized Complexity of Positional Games [PDF]
CoRR, 2017 To appear in the Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Bonnet, Edouard +4 more
openaire +5 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 +2 more
doaj +1 more source
Improving Vertex Cover as a Graph Parameter [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Parameterized algorithms are often used to efficiently solve NP-hard problems on graphs. In this context, vertex cover is used as a powerful parameter for dealing with graph problems which are hard to solve even when parameterized by tree-width; however,
Robert Ganian
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 +5 more
openaire +2 more sources
Some Open Problems in Parameterized Complexity Related to the Work of Jianer Chen
Tsinghua Science and Technology, 2014 This short paper highlights some open problems related to the work of Jianer Chen in the area of parameterized/multivariate algorithmics.
Michael Ralph Fellows
doaj +1 more source
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
On the Parameterized Complexity of Polytree Learning [PDF]
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021 A Bayesian network is a directed acyclic graph that represents statistical dependencies between variables of a joint probability distribution. A fundamental task in data science is to learn a Bayesian network from observed data. Polytree Learning is the problem of learning an optimal Bayesian network that fulfills the additional property that its ...
Niels Grüttemeier +2 more
openaire +2 more sources
Is FFT Fast Enough for Beyond 5G Communications? A Throughput-Complexity Analysis for OFDM Signals
IEEE Access, 2022 In this paper, we study the impact of computational complexity on the throughput limits of the fast Fourier transform (FFT) algorithm for orthogonal frequency division multiplexing (OFDM) waveforms.
Saulo Queiroz +2 more
doaj +1 more source