Title of article
Boundary classes of graphs for the dominating set problem Original Research Article
Author/Authors
Vladimir E. Alekseev، نويسنده , , Dmitry V Korobitsyn، نويسنده , , Vadim V. Lozin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
6
From page
1
To page
6
Abstract
The notion of a boundary class has been recently introduced as a tool for classification of hereditary classes of graphs according to the time complexity of NP-hard graph problems. In the present paper we concentrate on the dominating set problem and obtain three boundary classes for it.
Keywords
Dominating set , Hereditary class , Computational complexity
Journal title
Discrete Mathematics
Serial Year
2004
Journal title
Discrete Mathematics
Record number
948973
Link To Document