Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
Digital repository of Slovenian research organisations
About
Search
Browse
Statistics
Contacts
Login
Show document
A+
|
A-
|
|
SLO
|
ENG
Title:
Complexity of the game connected domination problem
Authors:
ID
Iršič Chenoweth, Vesna
(
Author
)
Files:
PDF - Presentation file,
download
(2,00 MB)
MD5: 0373E69595C391F11AD370DCAA9742F3
URL - Source URL, visit
https://www.sciencedirect.com/science/article/pii/S0304397525004979
Language:
English
Typology:
1.01 - Original Scientific Article
Organization:
IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract:
The connected domination game is a variant 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.
Keywords:
connected domination game
,
complexity
,
PSPACE-complete
Publication status:
Published
Publication version:
Version of Record
Publication date:
01.12.2025
Year of publishing:
2025
Number of pages:
11 str.
Numbering:
Vol. 1057, article no. 115559
PID:
20.500.12556/DiRROS-23810
UDC:
519.17
ISSN on article:
0304-3975
DOI:
10.1016/j.tcs.2025.115559
COBISS.SI-ID:
251830531
Note:
Publication date in DiRROS:
06.10.2025
Views:
233
Downloads:
95
Metadata:
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
Copy citation
Share:
Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.
Record is a part of a journal
Title:
Theoretical computer science
Shortened title:
Theor. comp. sci.
Publisher:
Elsevier
ISSN:
0304-3975
COBISS.SI-ID:
26525952
Document is financed by a project
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
Z1-50003
Name:
Igra policajev in roparja na grafih in geodetskih prostorih
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
P1-0297
Name:
Teorija grafov
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
N1-0218
Name:
Prepletanje geometrije, topologije in algebre v strukturni in topološki teoriji grafov
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
N1-0285
Name:
Metrični problemi v grafih in hipergrafih
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
N1-0355
Name:
Prirejanja, transverzale in hipergrafi
Funder:
EC - European Commission
Project number:
101071836
Name:
KARST: Predicting flow and transport in complex Karst systems
Acronym:
KARST
Licences
License:
CC BY 4.0, Creative Commons Attribution 4.0 International
Link:
http://creativecommons.org/licenses/by/4.0/
Description:
This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.
Secondary language
Language:
Slovenian
Keywords:
povezana dominacijska igra
,
zahtevnost
,
PSPACE-polno
Back