The parameterised complexity of counting connected subgraphs and graph motifs (Q2256721): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Importer (talk | contribs)
Changed an Item
Property / arXiv ID
 
Property / arXiv ID: 1308.1575 / rank
 
Normal rank

Revision as of 02:57, 19 April 2024

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
    counting complexity
    0 references
    parameterised complexity
    0 references
    FPTRAS
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references