Faster algorithms for finding and counting subgraphs (Q439930): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2011.10.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089369802 / rank
 
Normal rank

Revision as of 17:25, 19 March 2024

scientific article
Language Label Description Also known as
English
Faster algorithms for finding and counting subgraphs
scientific article

    Statements

    Faster algorithms for finding and counting subgraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 August 2012
    0 references
    parameterized complexity
    0 references
    subgraph isomorphism
    0 references
    homomorphism
    0 references
    counting
    0 references
    treewidth
    0 references

    Identifiers

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