Graph pattern detection: hardness for all induced patterns and faster non-induced cycles (Q5212856)

From MaRDI portal
Revision as of 00:53, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article; zbMATH DE number 7160589
Language Label Description Also known as
English
Graph pattern detection: hardness for all induced patterns and faster non-induced cycles
scientific article; zbMATH DE number 7160589

    Statements

    Graph pattern detection: hardness for all induced patterns and faster non-induced cycles (English)
    0 references
    30 January 2020
    0 references
    cliques
    0 references
    cycle detection
    0 references
    fine-grained complexity
    0 references
    subgraph isomorphism
    0 references

    Identifiers

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