Efficient dominating and edge dominating sets for graphs and hypergraphs (Q4909544)
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 6147812
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient dominating and edge dominating sets for graphs and hypergraphs |
scientific article; zbMATH DE number 6147812 |
Statements
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs (English)
0 references
21 March 2013
0 references
efficient domination
0 references
efficient dominating set
0 references
efficient edge domination
0 references
efficient edge dominating set
0 references
graphs
0 references
hypergraphs
0 references
polynomial time algorithms
0 references
0.9198369383811952
0 references
0.8518737554550171
0 references
0.8500747680664062
0 references
0.8452809453010559
0 references
