On reconfigurability of target sets
From MaRDI portal
Publication:2110378
DOI10.1016/j.tcs.2022.11.036OpenAlexW3186205939MaRDI QIDQ2110378
Publication date: 21 December 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.09885
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- The complexity of rerouting shortest paths
- Combinatorial model and bounds for target set selection
- Complexity of independent set reconfigurability problems
- Treewidth governs the complexity of target set selection
- Approximability of the subset sum reconfiguration problem
- Linear-time algorithm for sliding tokens on trees
- The complexity of dominating set reconfiguration
- On the parameterized complexity of reconfiguration problems
- Irreversible conversion of graphs
- On the complexity of reconfiguration problems
- An exact algorithm for the Boolean connectivity problem for \(k\)-CNF
- Shortest paths between shortest paths
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
- On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
- Size bounds for dynamic monopolies
- Local majorities, coalitions and monopolies in graphs: A review
- Reconfiguration in bounded bandwidth and tree-depth
- Dynamic monopolies for interval graphs with bounded thresholds
- Face covers and the genus problem for apex graphs
- Some results on the target set selection problem
- Target set selection for conservative populations
- Parameterized approximability of maximizing the spread of influence in networks
- Constant thresholds can make target set selection tractable
- Introduction to reconfiguration
- On line graphs of subcubic triangle-free graphs
- Connectedness of the graph of vertex-colourings
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Reconfiguration of colorable sets in classes of perfect graphs
- Independent Set Reconfiguration in Cographs and their Generalizations
- The complexity of change
- Reconfiguration over Tree Decompositions
- Reconfiguration of Vertex Covers in a Graph
- Finding paths between 3-colorings
- On Tractable Cases of Target Set Selection
- Reconfiguring Independent Sets in Claw-Free Graphs
- On the Approximability of Influence in Social Networks
- Irreversible 2-conversion set in graphs of bounded degree
- The Complexity of Independent Set Reconfiguration on Bipartite Graphs
- On Approximating Target Set Selection
- Parameterized Inapproximability of Target Set Selection and Generalizations
- On P 3-Convexity of Graphs with Bounded Degree
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas
- Parameterized Algorithms
- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
This page was built for publication: On reconfigurability of target sets
