Generalized domination in degenerate graphs: A complete dichotomy of computational complexity
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F08%3A00100095" target="_blank" >RIV/00216208:11320/08:00100095 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Generalized domination in degenerate graphs: A complete dichotomy of computational complexity
Original language description
We show that for every k, the problem of existence of a (sigma,rho)-dominating set performs a complete dichotomy when restricted to k-degenerate graphs, and we fully characterize the polynomial and NP-complete instances. It is further shown that the problem is polynomial time solvable if sigma, rho are such that every k-degenerate graph contains at most one (sigma, rho)-dominating set, and NP-complete otherwise. This relates to the concept of ambivalent graphs previously introduced for chordal graphs.
Czech name
Zobecněná dominace v degenerovaných grafech: Úplná dichotomie výpočetní složitosti
Czech description
Ukazujeme, že pro každé číslo k je otázka existence (sigma,ro)-dominující množiny v daném k=degenerovaném grafu buď polynomiální nebo NP-úplná, a podáváme úplnou charakterizaci těchto případů pro konečné množiny sigma a ro.
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
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
2008
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
Theory and Applications of Models of Computation, Proceedings
ISBN
978-3-540-79227-7
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
—
Publisher name
Springer
Place of publication
Berlin
Event location
Berlin
Event date
Jan 1, 2008
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000255239500016