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

From MaRDI portal
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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph homomorphism
    0 references
    string graphs
    0 references
    segment graphs
    0 references
    subexponential algorithms
    0 references
    ETH
    0 references
    0 references
    0 references