Reconfiguration of Dominating Sets

  title={Reconfiguration of Dominating Sets},
  author={Akira Suzuki and Amer E. Mouawad and Naomi Nishimura},
  journal={J. Comb. Optim.},
We explore a reconfiguration version of the dominating set problem, where a dominating set in a graph G is a set S of vertices such that each vertex is either in S or has a neighbour in S. In a reconfiguration problem, the goal is to determine whether there exists a sequence of feasible solutions connecting given feasible solutions s and t such that each pair of consecutive solutions is adjacent according to a specified adjacency relation. Two dominating sets are adjacent if one can be formed… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS
10 Citations
21 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 21 references

Milanič. Complexity of independent set reconfigurability problems

  • M. Kamiński, P. Medvedev
  • Theor. Comput. Sci.,
  • 2012
1 Excerpt

Finding paths between 3-colorings

  • L. Cereceda, J. van den Heuvel, M. Johnson
  • J. of Graph Theory,
  • 2011
1 Excerpt

Similar Papers

Loading similar papers…