The computational complexity of dominating set problems for instances with bounded minors of constraint matrices (Q1662648): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disopt.2018.03.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2795518735 / rank | |||
Normal rank | |||
Revision as of 23:40, 19 March 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
