Complexity of the approximation of the independent dominating set problem in the class of \(2P_3\)-free perfect graphs (Q2837369)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of the approximation of the independent dominating set problem in the class of \(2P_3\)-free perfect graphs |
scientific article; zbMATH DE number 6186509
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of the approximation of the independent dominating set problem in the class of \(2P_3\)-free perfect graphs |
scientific article; zbMATH DE number 6186509 |
Statements
10 July 2013
0 references
dominating set
0 references
independent set
0 references
independent dominating set
0 references
Complexity of the approximation of the independent dominating set problem in the class of \(2P_3\)-free perfect graphs (English)
0 references
