The parallel complexity of graph canonization under abelian group action (Q378219)

From MaRDI portal
Revision as of 00:06, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
The parallel complexity of graph canonization under abelian group action
scientific article

    Statements

    title
    The parallel complexity of graph canonization under abelian group action (English)
    0 references
    author
    V. Arvind
    0 references
    Johannes Köbler
    0 references
    published in
    Algorithmica
    0 references
    publication date
    11 November 2013
    0 references
    zbMATH Keywords
    graph isomorphism
    0 references
    logspace counting classes
    0 references
    parallel complexity
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q15
    0 references
    68Q17
    0 references
    05C60
    0 references
    05C78
    0 references
    05C65
    0 references
    05C15
    0 references
    zbMATH DE Number
    6225268
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q378219&oldid=25543455"
    Powered by MediaWiki