Solving the connected dominating set problem and power dominating set problem by integer programming (Q3167378)
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 6101524
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the connected dominating set problem and power dominating set problem by integer programming |
scientific article; zbMATH DE number 6101524 |
Statements
Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming (English)
0 references
2 November 2012
0 references
connected dominating set problem
0 references
power dominating set problem
0 references
integer programming
0 references
spanning tree
0 references
connected subgraph
0 references
0.8217759728431702
0 references
0.81459641456604
0 references
0.8071150183677673
0 references
0.7956172227859497
0 references
0.7936360239982605
0 references
