Strong intractability results for generalized convex recoloring problems (Q2184691)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Strong intractability results for generalized convex recoloring problems
scientific article

    Statements

    Strong intractability results for generalized convex recoloring problems (English)
    0 references
    0 references
    0 references
    29 May 2020
    0 references
    convex coloring
    0 references
    inapproximability
    0 references
    hardness
    0 references
    bipartite graph
    0 references

    Identifiers