| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437714 | Theoretical Computer Science | 2010 | 5 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
