The computational complexity of dominating set problems for instances with bounded minors of constraint matrices (Q1662648): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1669582 |
Changed an Item |
||
| Property / author | |||
| Property / author: Dmitriy S. Malyshev / rank | |||
Normal rank | |||
Revision as of 07:22, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computational complexity of dominating set problems for instances with bounded minors of constraint matrices |
scientific article |
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
