Treffer: Improved algorithms and complexity results for power domination in graphs

Title:
Improved algorithms and complexity results for power domination in graphs
Authors:
JIONG GUO, NIEDERMEIER, Rolf, RAIBLE, Daniel
Source:
FCT 2005 : fundamentals of computationals theory (Lübeck, 17-20 August 2005)Lecture notes in computer science. :172-184
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 12 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Ensemble dominant, Dominating set, Conjunto dominando, Graphe complet, Complete graph, Grafo completo, Graphe non orienté, Non directed graph, Grafo no orientado, Graphe planaire, Planar graph, Grafo planario, Informatique théorique, Computer theory, Informática teórica, Largeur arborescente, Treewidth, Anchura arbol, Théorie graphe, Graph theory, Teoría grafo
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Institut für Informatik, Friedrich-Schiller-Universität Jena, Ernst-Abbe-Platz 2, 07743 Jena, Germany
Wilhelm-Schickard-Institut für Informatik, Universität Tiibingen, Sand 13, 72076 Tübingen, Germany
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=17115732
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17115732
Database:
PASCAL Archive

Weitere Informationen

The POWER DOMINATING SET problem is a variant of the classical domination problem in graphs: Given an undirected graph G = (V, E), find a minimum P C V such that all vertices in V are observed by vertices in P. Herein, a vertex observes itself and all its neighbors, and if an observed vertex has all but one of its neighbors observed, then the remaining neighbor becomes observed as well. We show that POWER DOMINATING SET can be solved by bounded-treewidth dynamic programs. Moreover, we simplify and extend several NP-completeness results, particularly showing that POWER DOMINATING SET remains NP-complete for planar graphs, for circle graphs, and for split graphs. Specifically, our improved reductions imply that POWER DOMINATING SET parameterized by |P| is W[2]-hard and cannot be better approximated than DOMINATING SET.