Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs (Q4909544): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:18, 8 February 2024
scientific article; zbMATH DE number 6147812
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
