Results 41 to 50 of about 1,615,193 (298)
Parameterized Complexity of Perfectly Matched Sets [PDF]
, 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
Parameterized complexity of conflict-free graph coloring [PDF]
, 2021 Given a graph G, a q-open neighborhood confict-free coloring or q-ONCF-coloring is a vertex coloring c: V (G) {1, 2,..., q} such that for each vertex ν V (G) there is a vertex in N(v) that is uniquely colored from the rest of the vertices in N(ν).
Pieterse, Astrid +2 more
core +3 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 +2 more sources
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
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
Order Reconfiguration under Width Constraints
Journal of Graph Algorithms and Applications, 2023 In this work, we consider the following order reconfiguration problem: Given a graph $G$ together with linear orders $\omega$ and $\omega'$ of the vertices of $G$, can one transform $\omega$ into $\omega'$ by a sequence of swaps of adjacent elements in ...
Emmanuel Arrighi +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)
Édouard Bonnet +4 more
openaire +6 more sources
How Bad is the Freedom to Flood-It?
Journal of Graph Algorithms and Applications, 2019 ${\rm F{\small IXED-}F{\small LOOD-}I{\small T}}$ and ${\rm F{\small REE-}F{\small LOOD-}I{\small T}}$ are combinatorial problems on graphs that generalize a very popular puzzle called Flood-It. Both problems consist of recoloring moves whose goal is to
Rémy Belmonte +4 more
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 +3 more sources
Governing Complexity in World Politics
, 2021 Complexity is the new global ontology for world politics. This article summarizes the characteristics of complexity and its implications for informed US state policy making.
Western, Jon, Haas, Peter M
core +1 more source