The complexity of symmetrizing matrices (Q600245)

From MaRDI portal
Revision as of 01:07, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of symmetrizing matrices
scientific article

    Statements

    title
    The complexity of symmetrizing matrices (English)
    0 references
    publication date
    1979
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68R10
    0 references
    05C50
    0 references
    zbMATH DE Number
    3646277
    0 references
    zbMATH Keywords
    graph isomorphism problem
    0 references
    symmetrizable matrix
    0 references
    transposable matrix
    0 references
    isomorphism completeness
    0 references
    Np-completeness
    0 references
    OpenAlex ID
    W2015658073
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q600245&oldid=32526069"
    Powered by MediaWiki