On the parameterized complexity of reconfiguration of connected dominating sets
From MaRDI portal
Recommendations
Cites work
- Connectedness of the graph of vertex-colourings
- Domination problems in nowhere-dense classes of graphs
- Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness
- Flip distance between two triangulations of a point set is NP-complete
- Flip distance is in FPT time O(n+ k c^k)
- Geometric folding algorithms. Linkages, origami, polyhedra
- scientific article; zbMATH DE number 1947062 (Why is no real title available?)
- scientific article; zbMATH DE number 2209525 (Why is no real title available?)
- Introduction to reconfiguration
- Kernelization and Sparseness: the case of Dominating Set
- Kernelization using structural parameters on sparse graph classes
- Linear time solvable optimization problems on graphs of bounded clique-width
- Lossy kernels for connected dominating set on sparse graphs
- Neighborhood complexity and kernelization for nowhere dense classes of graphs
- On the complexity of reconfiguration problems
- On the number of types in sparse graphs
- Parameterized algorithms
- Polynomial kernels and wideness properties of nowhere dense graph classes
- Progressive algorithms for domination and independence
- Reconfiguration of list edge-colorings in a graph
- Reconfiguration on nowhere dense graph classes
- Shortest reconfiguration paths in the solution space of Boolean formulas
- Simpler and better approximation algorithms for network design
- The \(k\)-dominating graph
- The complexity of change
- The complexity of dominating set reconfiguration
- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Cited in
(13)- Reconfiguration graphs for dominating sets
- Parameterized complexity of independent set reconfiguration problems
- Reconfiguring dominating sets in some well-covered and other classes of graphs
- On the parameterized complexity of dynamic problems with connectivity constraints
- The complexity of dominating set reconfiguration
- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework
- The complexity of dominating set reconfiguration
- On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets
- Algorithmic meta-theorems for combinatorial reconfiguration revisited
- Bipartite independent set reconfiguration: general and RNA-inspired parameterized algorithms
- Algorithmic meta-theorems for combinatorial reconfiguration revisited
- A survey on the parameterized complexity of reconfiguration problems
- The tape reconfiguration problem and its consequences for dominating set reconfiguration
This page was built for publication: On the parameterized complexity of reconfiguration of connected dominating sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832526)
