Results 31 to 40 of about 1,864,097 (296)

Counting Problems in Parameterized Complexity [PDF]

open access: yes, 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

Counting Problems in Parameterized Complexity

open access: yesTsinghua Science and Technology, 2014
Parameterized complexity is a multivariate theory for the analysis of computational problems. It leads to practically efficient algorithms for many 𝐍𝐏-hard problems and also provides a much finer complexity classification for other intractable problems ...
Chihao Zhang, Yijia Chen
doaj   +1 more source

On the Descriptive Complexity of Color Coding

open access: yesAlgorithms, 2021
Color coding is an algorithmic technique used in parameterized complexity theory to detect “small” structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable, small color ...
Max Bannach, Till Tantau
doaj   +1 more source

Parameterized Complexity of Graph Burning [PDF]

open access: yes, 2020
Graph Burning asks, given a graph G = (V,E) and an integer k, whether there exists (b₀,… ,b_{k-1}) ∈ V^{k} such that every vertex in G has distance at most i from some b_i. This problem is known to be NP-complete even on connected caterpillars of maximum
Otachi, Yota, Kobayashi, Yasuaki
core   +1 more source

Parameterized complexity of firefighting

open access: yesJournal of Computer and System Sciences, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cristina Bazgan   +5 more
openaire   +5 more sources

Clique Transversal Variants on Graphs: A Parameterized-Complexity Perspective

open access: yesMathematics, 2023
The clique transversal problem and its variants have garnered significant attention in the last two decades due to their practical applications in communication networks, social-network theory and transceiver placement for cellular telephones.
Chuan-Min Lee
doaj   +1 more source

Parameterized Complexity of Geodetic Set [PDF]

open access: yes, 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

Parameterized Complexity of Perfectly Matched Sets [PDF]

open access: yes, 2022
For an undirected graph G, a pair of vertex disjoint subsets (A, B) is a pair of perfectly matched sets if each vertex in A (resp. B) has exactly one neighbor in B (resp. A). In the above, the size of the pair is |A| (= |B|).
Agrawal, Akanksha   +3 more
core   +1 more source

On the Parameterized Complexity of Consensus Clustering [PDF]

open access: yesTheoretical Computer Science, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Dörnfelder   +3 more
openaire   +4 more sources

A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy

open access: yesAlgorithms, 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

Home - About - Disclaimer - Privacy