A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS (Q5696912): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 23:56, 5 March 2024
scientific article; zbMATH DE number 2216284
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS |
scientific article; zbMATH DE number 2216284 |
Statements
A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS (English)
0 references
19 October 2005
0 references
connected dominating set
0 references
2-independent set
0 references
minor
0 references
approximation algorithm
0 references
