Wiley Encyclopedia of Operations Research and Management Science 2011
DOI: 10.1002/9780470400531.eorms0266
|View full text |Cite
|
Sign up to set email alerts
|

Domination Problems

Abstract: In this article, we focus on dominating set problems in graphs. We review the literature that analyzes domination from different aspects, including bounds for the domination number, the algorithmic complexity, and valid inequality chains associated with each domination variant. In particular, we discuss the relationship between domination, independence, and irredundance, and reveal the well‐known domination chain and its properties. As many domination‐related problems can be solved in polynomial time for certa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2013
2013
2013
2013

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 66 publications
0
1
0
Order By: Relevance
“…The attacker's problem that we consider in this paper is related to the classical dominating set problem [17]. In the dominating set problem, a minimum-cardinality subset of nodes D is sought in an undirected graph G = (V , E) such that every node in V \D is adjacent to at least one of the nodes in D [9].…”
Section: Literature Reviewmentioning
confidence: 99%
“…The attacker's problem that we consider in this paper is related to the classical dominating set problem [17]. In the dominating set problem, a minimum-cardinality subset of nodes D is sought in an undirected graph G = (V , E) such that every node in V \D is adjacent to at least one of the nodes in D [9].…”
Section: Literature Reviewmentioning
confidence: 99%