\(\mathcal{IV}\)-matching is strongly \textsf{NP}-hard (Q2628277)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(\mathcal{IV}\)-matching is strongly \textsf{NP}-hard |
scientific article |
Statements
\(\mathcal{IV}\)-matching is strongly \textsf{NP}-hard (English)
0 references
13 June 2017
0 references
combinatorial problems
0 references
computational complexity
0 references
graph matching
0 references
graph algorithms
0 references
NP-completeness
0 references
