Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (Q5860479)

From MaRDI portal
Revision as of 18:00, 3 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7430751
Language Label Description Also known as
English
Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles
scientific article; zbMATH DE number 7430751

    Statements

    Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (English)
    0 references
    19 November 2021
    0 references
    fine-grained complexity
    0 references
    subgraph isomorphism
    0 references
    cliques
    0 references
    cycle detection
    0 references

    Identifiers

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