On distance \(r\)-dominating and \(2r\)-independent sets in sparse graphs (Q5379844)
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 7066129
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On distance \(r\)-dominating and \(2r\)-independent sets in sparse graphs |
scientific article; zbMATH DE number 7066129 |
Statements
On distance ‐dominating and ‐independent sets in sparse graphs (English)
0 references
14 June 2019
0 references
dominating set
0 references
independent set
0 references
linear programming
0 references
0.7926766872406006
0 references
0.792084276676178
0 references
0.7850266695022583
0 references
0.7765634059906006
0 references
0.7698512673377991
0 references
