Computational complexity of generalized domination: A complete dichotomy for chordal graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F07%3A00206159" target="_blank" >RIV/00216208:11320/07:00206159 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Computational complexity of generalized domination: A complete dichotomy for chordal graphs
Original language description
We show that for chordal graphs, the problem of deciding the existence of a ($sigma,rho$)-dominating set performs a complete dichotomy: it is polynomial time solvable if $sigma, rho$ are such that every chordal graph contains at most one $(sigma,rho)$-dominating set, and NP-complete otherwise. The proof involves certain flavor of existentionality - we are not able to characterize such pairs $(sigma,rho)$ by a structural description, but at least we can provide a recursive algorithm for their recognition.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2007
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Graph-theoretic Concepts in Computer Science
ISBN
978-3-540-74838-0
ISSN
—
e-ISSN
—
Number of pages
11
Pages from-to
—
Publisher name
Springer
Place of publication
Berlin
Event location
Berlin
Event date
Jan 1, 2007
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000252884200001