A decidability result for the dominating set problem

We study the following question: given a finite collection of graphs G1,…,Gk, is the dominating set problem polynomial-time solvable in the class of (G1,…,Gk)-free graphs? In this paper, we prove the existence of an efficient algorithm that answers this question for k=2.

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 411; no. 44-46; pp. 4023 - 4027
Main Author Lozin, Vadim V.
Format Journal Article
LanguageEnglish
Published Oxford Elsevier B.V 25.10.2010
Elsevier
Subjects
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
C (programming language)
Collection
Computational complexity
Computer science; control theory; systems
Decidability
Dominating set
Exact sciences and technology
Graphs
Information retrieval. Graph
Mathematical analysis
Miscellaneous
Non-constructive proof
Theoretical computing
Well-quasi-order
Non-constructive proof
Well-quasi-order
Dominating set
Decidability
Computational complexity
Computer theory
Finite graph
Proof
Algorithm
Polynomial time
Online AccessGet full text

Cover

More Information
Summary:We study the following question: given a finite collection of graphs G1,…,Gk, is the dominating set problem polynomial-time solvable in the class of (G1,…,Gk)-free graphs? In this paper, we prove the existence of an efficient algorithm that answers this question for k=2.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2010.08.027