Results 31 to 40 of about 23,779 (205)

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

Parameterized streaming : maximal matching and vertex cover [PDF]

, 2014
As graphs continue to grow in size, we seek ways to effectively process such data at scale. The model of streaming graph processing, in which a compact summary is maintained as each edge insertion/deletion is observed, is an attractive one.
Chitnis, Rajesh; id_orcid, Graham Cormode, Hajiaghayi, Mohammad Taghi, Monezimadeh, Morteza, Rajesh Chitnis, Morteza Monemizadeh, Hajiaghayi, MohammadTaghi, Chitnis, Rajesh, Mohammad Taghi Hajiaghayi, MohammadTaghi Hajiaghayi, Monemizadeh, Morteza, Cormode, Graham   +11 more
core   +1 more source

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   +1 more source

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, Joao P. Vilela, Edmundo Monteiro   +2 more
doaj   +1 more source

Parameterized Complexity of Geodetic Set [PDF]

, 2020
A vertex set S of a graph G is geodetic if every vertex of G lies on a shortest path between two vertices in S. Given a graph G and k ∈ ℕ, the NP-hard Geodetic Set problem asks whether there is a geodetic set of size at most k.
Koana, Tomohiro, Kellerhals, Leon
core   +1 more source

09511 Open Problems – Parameterized complexity and approximation algorithms [PDF]

, 2010
The paper contains a list of the problems presented on Monday, December 14, 2009 at the open problem session of the Seminar on Parameterized Complexity and Approximation Algorithms, held at Schloss Dagstuhl in Wadern ...
Marx, Dániel, Hajiaghayi, MohammadTaghi, Demaine, Erik D.   +2 more
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.
Cristina Bazgan, Morgan Chopin, Marek Cygan, Michael R. Fellows, Fedor V. Fomin, Erik Jan van Leeuwen   +5 more
openaire   +4 more sources

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

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

Counting Problems in Parameterized Complexity [PDF]

, 2019
This survey is an invitation to parameterized counting problems for readers with a background in parameterized algorithms and complexity. After an introduction to the peculiarities of counting complexity, we survey the parameterized approach to counting ...
Curticapean, Radu
core   +1 more source