Corpus ID: 203626793

On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets

@article{Lokshtanov2019OnTP,
  title={On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets},
  author={Daniel Lokshtanov and Amer E. Mouawad and Fahad Panolan and Sebastian Siebertz},
  journal={ArXiv},
  year={2019},
  volume={abs/1910.00581}
}
  • Daniel Lokshtanov, Amer E. Mouawad, +1 author Sebastian Siebertz
  • Published in ArXiv 2019
  • Mathematics, Computer Science
  • In a reconfiguration version of an optimization problem $\mathcal{Q}$ the input is an instance of $\mathcal{Q}$ and two feasible solutions $S$ and $T$. The objective is to determine whether there exists a step-by-step transformation between $S$ and $T$ such that all intermediate steps also constitute feasible solutions. In this work, we study the parameterized complexity of the \textsc{Connected Dominating Set Reconfiguration} problem (\textsc{CDS-R)}. It was shown in previous work that the… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 27 REFERENCES

    Reconfiguration on nowhere dense graph classes

    Toruńczyk. On the number of types in sparse graphs

    • Michał Pilipczuk, Sebastian Siebertz, Szymon
    • In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science,
    • 2018