The computational complexity of dominating set problems for instances with bounded minors of constraint matrices (Q1662648)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The computational complexity of dominating set problems for instances with bounded minors of constraint matrices |
scientific article; zbMATH DE number 6920585
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational complexity of dominating set problems for instances with bounded minors of constraint matrices |
scientific article; zbMATH DE number 6920585 |
Statements
The computational complexity of dominating set problems for instances with bounded minors of constraint matrices (English)
0 references
20 August 2018
0 references
Boolean linear programming
0 references
dominating set problem
0 references
matrix minor
0 references
efficient algorithm
0 references
0.9338285326957704
0 references
0.7811612486839294
0 references
0.7795272469520569
0 references
0.7791838049888611
0 references
0.7776806950569153
0 references
