Graph 2-isomorphism is NP-complete (Q1259902)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graph 2-isomorphism is NP-complete |
scientific article; zbMATH DE number 3640869
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph 2-isomorphism is NP-complete |
scientific article; zbMATH DE number 3640869 |
Statements
Graph 2-isomorphism is NP-complete (English)
0 references
1979
0 references
complexity
0 references
Np-complete
0 references
graph isomorphism
0 references
exact cover
0 references
