Graph 2-isomorphism is NP-complete (Q1259902)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Graph 2-isomorphism is NP-complete
scientific article

    Statements

    Graph 2-isomorphism is NP-complete (English)
    0 references
    0 references
    1979
    0 references
    complexity
    0 references
    Np-complete
    0 references
    graph isomorphism
    0 references
    exact cover
    0 references
    0 references
    0 references
    0 references

    Identifiers