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

From MaRDI portal
Revision as of 18:01, 9 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
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