Graph matching problems and the NP-hardness of sortedness constraints (Q2402671)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph matching problems and the NP-hardness of sortedness constraints |
scientific article |
Statements
Graph matching problems and the NP-hardness of sortedness constraints (English)
0 references
13 September 2017
0 references
computational complexity
0 references
graph matching
0 references
bipartite graph
0 references
constraint programming
0 references
sortedness constraints
0 references
