The computational complexity of dominating set problems for instances with bounded minors of constraint matrices (Q1662648): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q130041840, #quickstatements; #temporary_batch_1726345393210 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q130041840 / rank | |||
Normal rank | |||
Latest revision as of 21:23, 14 September 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
