Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363)

From MaRDI portal
Revision as of 20:50, 2 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Subexponential algorithms for variants of the homomorphism problem in string graphs
scientific article

    Statements

    Subexponential algorithms for variants of the homomorphism problem in string graphs (English)
    0 references
    0 references
    0 references
    24 February 2020
    0 references
    graph homomorphism
    0 references
    string graphs
    0 references
    segment graphs
    0 references
    subexponential algorithms
    0 references
    ETH
    0 references

    Identifiers

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