Subexponential Time Algorithms for Embedding H-Minor Free Graphs (Q4598141)

From MaRDI portal
Revision as of 10:59, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6820198
Language Label Description Also known as
English
Subexponential Time Algorithms for Embedding H-Minor Free Graphs
scientific article; zbMATH DE number 6820198

    Statements

    0 references
    0 references
    0 references
    19 December 2017
    0 references
    subgraph isomorphism
    0 references
    graph minors
    0 references
    subexponential time
    0 references
    Subexponential Time Algorithms for Embedding H-Minor Free Graphs (English)
    0 references

    Identifiers

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