Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (Q1801055)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6966406
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs |
scientific article; zbMATH DE number 6966406 |
Statements
Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (English)
0 references
26 October 2018
0 references
weighted efficient domination
0 references
modular decomposition
0 references
\(H\)-free graphs
0 references
linear forest
0 references
\((H_1, H_2)\)-free graphs
0 references
polynomial-time algorithm
0 references
0 references
0 references
0 references
0.9284993410110474
0 references
0.91866135597229
0 references
0.8899037837982178
0 references
0.8895811438560486
0 references
0.8881087899208069
0 references
