Results 41 to 50 of about 128,668 (237)
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
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 +3 more
core +2 more sources
Parameterized complexity of firefighting
Journal of Computer and System Sciences, 2014 The Firefighter problem is to place firefighters on the vertices of a graph to prevent a fire with known starting point from lighting up the entire graph. In each time step, a firefighter may be placed on an unburned vertex, permanently protecting it, and the fire spreads to all neighboring unprotected vertices of burning vertices.
Erik Jan van Leeuwen +6 more
openaire +4 more sources
Computation Models for Parameterized Complexity [PDF]
Mathematical Logic Quarterly, 1997 AbstractA parameterized computational problem is a set of pairs (x,k), wherekis a distinguished item called “parameter”. FPT is the class of fixed‐parameter tractable problems: for any fixed value ofk, they are solvable in time bounded by a polynomial of degree α, where α is a constant not dependent on the parameter. In order to deal with parameterized
Cesati M., Di Ianni M.
openaire +3 more sources
, 2015 In resolving instances of a computational problem, if multiple instances of interest share a feature in common, it may be fruitful to compile this feature into a format that allows for more efficient resolution, even if the compilation is relatively ...
Chen, Hubie
core +2 more sources
The Parameterized Complexity of Graph Cyclability [PDF]
SIAM Journal on Discrete Mathematics, 2014 The cyclability of a graph is the maximum integer $k$ for which every $k$ vertices lie on a cycle. The algorithmic version of the problem, given a graph $G$ and a non-negative integer $k,$ decide whether the cyclability of $G$ is at least $k,$ is {\sf NP}-hard. We study the parametrized complexity of this problem.
Marcin Kamiński +4 more
openaire +6 more sources
Parameterized Complexity of Geodetic Set
Journal of Graph Algorithms and Applications, 2022 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 \in \mathbb{N}$, the NP-hard ${\rm G{\small EODETIC}~S{ \small ET}}$ problem asks whether there is a geodetic set of size at most $k$.
Kellerhals, Leon, Koana, Tomohiro
openaire +5 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
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