The graph isomorphism problem and approximate categories (Q2437326)

From MaRDI portal
Revision as of 10:38, 7 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The graph isomorphism problem and approximate categories
scientific article

    Statements

    title
    The graph isomorphism problem and approximate categories (English)
    0 references
    publication date
    3 March 2014
    0 references
    Mathematics Subject Classification ID
    05C60
    0 references
    05C85
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6264263
    0 references
    zbMATH Keywords
    graph isomorphism problem
    0 references
    Weisfeiler-Lehman algorithm
    0 references
    complexity theory
    0 references
    categories
    0 references
    author
    H. G. J. Derksen
    0 references
    OpenAlex ID
    W2963835421
    0 references
    arXiv ID
    1012.2081
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2437326&oldid=35375721"
    Powered by MediaWiki