Comparing universal covers in polynomial time (Q987372)

From MaRDI portal
Revision as of 23:36, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Comparing universal covers in polynomial time
scientific article

    Statements

    title
    Comparing universal covers in polynomial time (English)
    0 references
    author
    Jiří Fiala
    0 references
    Daniël Paulusma
    0 references
    publication date
    13 August 2010
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C70
    0 references
    05C85
    0 references
    90C59
    0 references
    zbMATH DE Number
    5770218
    0 references
    zbMATH Keywords
    graph homomorphism
    0 references
    universal cover
    0 references
    computational complexity
    0 references
    degree matrix
    0 references
    OpenAlex ID
    W2087073372
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q987372&oldid=32209093"
    Powered by MediaWiki