On efficient domination for some classes of \(H\)-free bipartite graphs (Q2334041)
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 7127270
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On efficient domination for some classes of \(H\)-free bipartite graphs |
scientific article; zbMATH DE number 7127270 |
Statements
On efficient domination for some classes of \(H\)-free bipartite graphs (English)
0 references
6 November 2019
0 references
weighted efficient domination
0 references
\(H\)-free bipartite graphs
0 references
NP-completeness
0 references
polynomial time algorithm
0 references
clique-width
0 references
0 references
0 references
0 references
0.8990871906280518
0 references
0.8896582722663879
0 references
0.8870207071304321
0 references
0.8869658708572388
0 references
