Direct product primality testing of graphs is GI-hard (Q1998840)

From MaRDI portal
Revision as of 22:51, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Direct product primality testing of graphs is GI-hard
scientific article

    Statements

    Direct product primality testing of graphs is GI-hard (English)
    0 references
    0 references
    0 references
    0 references
    9 March 2021
    0 references
    Kronecker product
    0 references
    graph factorization
    0 references
    graph isomorphism
    0 references
    GI-complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references