Complexity issues in vertex-colored graph pattern matching (Q533412)

From MaRDI portal
Revision as of 00:55, 4 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
Complexity issues in vertex-colored graph pattern matching
scientific article

    Statements

    title
    Complexity issues in vertex-colored graph pattern matching (English)
    0 references
    author
    Riccardo Dondi
    0 references
    Guillaume Fertin
    0 references
    Stéphane Vialette
    0 references
    publication date
    3 May 2011
    0 references
    Mathematics Subject Classification ID
    05C15
    0 references
    05C85
    0 references
    68Q17
    0 references
    zbMATH DE Number
    5883236
    0 references
    zbMATH Keywords
    graph motifs
    0 references
    vertex-colored graphs
    0 references
    algorithmic complexity
    0 references
    parameterized complexity
    0 references
    OpenAlex ID
    W2086133268
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q533412&oldid=35225021"
    Powered by MediaWiki