Maximum bounded \(H\)-matching is Max SNP-complete (Q1321820)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum bounded \(H\)-matching is Max SNP-complete |
scientific article |
Statements
Maximum bounded \(H\)-matching is Max SNP-complete (English)
0 references
3 May 1994
0 references
Max SNP-complete problems
0 references
