The parameterised complexity of counting connected subgraphs and graph motifs (Q2256721)

From MaRDI portal
Revision as of 04:18, 22 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q1058289)
scientific article
Language Label Description Also known as
English
The parameterised complexity of counting connected subgraphs and graph motifs
scientific article

    Statements

    title
    The parameterised complexity of counting connected subgraphs and graph motifs (English)
    0 references
    author
    Kitty Meeks
    0 references
    publication date
    20 February 2015
    0 references
    zbMATH Keywords
    counting complexity
    0 references
    parameterised complexity
    0 references
    FPTRAS
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    05C30
    0 references
    68Q17
    0 references
    68W25
    0 references
    zbMATH DE Number
    6406627
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2256721&oldid=22412622"
    Powered by MediaWiki