Tight Lower Bounds on Graph Embedding Problems (Q4640290)

From MaRDI portal
Revision as of 00:05, 2 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6869371
Language Label Description Also known as
English
Tight Lower Bounds on Graph Embedding Problems
scientific article; zbMATH DE number 6869371

    Statements

    Tight Lower Bounds on Graph Embedding Problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 May 2018
    0 references
    lower bounds
    0 references
    exponential time hypothesis
    0 references
    graph embedding
    0 references
    graph homomorphism
    0 references
    subgraph isomorphism
    0 references

    Identifiers