Complexity of the game connected domination problem
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915313350606848 |
|---|---|
| author | Chenoweth, Vesna Iršič |
| author_facet | Chenoweth, Vesna Iršič |
| contents | The connected domination game is a variation of the domination game where the played vertices must form a connected subgraph at all stages of the game. In this paper we prove that deciding whether the game connected domination number is smaller than a given integer is PSPACE-complete using log-space reductions for both Dominator- and Staller-start connected domination game. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_08776 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Complexity of the game connected domination problem Chenoweth, Vesna Iršič Combinatorics The connected domination game is a variation of the domination game where the played vertices must form a connected subgraph at all stages of the game. In this paper we prove that deciding whether the game connected domination number is smaller than a given integer is PSPACE-complete using log-space reductions for both Dominator- and Staller-start connected domination game. |
| title | Complexity of the game connected domination problem |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2404.08776 |