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

From MaRDI portal
scientific article
Language Label Description Also known as
English
The parameterised complexity of counting connected subgraphs and graph motifs
scientific article

    Statements

    The parameterised complexity of counting connected subgraphs and graph motifs (English)
    0 references
    0 references
    0 references
    20 February 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    counting complexity
    0 references
    parameterised complexity
    0 references
    FPTRAS
    0 references
    0 references
    0 references