Finding and counting vertex-colored subtrees (Q1949738)

From MaRDI portal
Revision as of 02:05, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Finding and counting vertex-colored subtrees
scientific article

    Statements

    title
    Finding and counting vertex-colored subtrees (English)
    0 references
    author
    Sylvain Guillemot
    0 references
    Florian Sikora
    0 references
    published in
    Algorithmica
    0 references
    publication date
    16 May 2013
    0 references
    Mathematics Subject Classification ID
    05C15
    0 references
    05C60
    0 references
    05C90
    0 references
    68R10
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6163644
    0 references
    zbMATH Keywords
    parameterized complexity
    0 references
    pattern matching in graphs
    0 references
    biological networks
    0 references
    vertex-colored graphs
    0 references
    OpenAlex ID
    W2763029945
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1949738&oldid=32719792"
    Powered by MediaWiki