The complexity of minimum convex coloring (Q415283)

From MaRDI portal
Revision as of 05:22, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of minimum convex coloring
scientific article

    Statements

    title
    The complexity of minimum convex coloring (English)
    0 references
    author
    Frank Kammer
    0 references
    Torsten Tholey
    0 references
    publication date
    11 May 2012
    0 references
    Mathematics Subject Classification ID
    05C15
    0 references
    05C85
    0 references
    68W25
    0 references
    zbMATH DE Number
    6033765
    0 references
    zbMATH Keywords
    convex coloring
    0 references
    approximation algorithm
    0 references
    treewidth
    0 references
    maximum disjoint paths problem
    0 references
    set cover
    0 references
    OpenAlex ID
    W1983029152
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q415283&oldid=35278005"
    Powered by MediaWiki