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

From MaRDI portal
Revision as of 17:27, 16 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Direct product primality testing of graphs is GI-hard
scientific article

    Statements

    title
    Direct product primality testing of graphs is GI-hard (English)
    0 references
    author
    Luca Calderoni
    0 references
    Moreno Marzolla
    0 references
    Luciano Margara
    0 references
    publication date
    9 March 2021
    0 references
    zbMATH Keywords
    Kronecker product
    0 references
    graph factorization
    0 references
    graph isomorphism
    0 references
    GI-complexity
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C76
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    7318688
    0 references
    OpenAlex ID
    W3122115655
    0 references
    arXiv ID
    2003.01591
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1998840&oldid=38823504"
    Powered by MediaWiki