The complexity of the empire colouring problem (Q476435)

From MaRDI portal
Revision as of 14:01, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
The complexity of the empire colouring problem
scientific article

    Statements

    title
    The complexity of the empire colouring problem (English)
    0 references
    author
    Andrew R. A. McGrae
    0 references
    Michele Zito
    0 references
    published in
    Algorithmica
    0 references
    publication date
    2 December 2014
    0 references
    zbMATH Keywords
    colouring
    0 references
    planar graphs
    0 references
    NP-hardness
    0 references
    graph algorithms
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    05C10
    0 references
    05C15
    0 references
    05C85
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6375638
    0 references
    OpenAlex ID
    W3103087101
    0 references
    arXiv ID
    1109.2162
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q476435&oldid=33316837"
    Powered by MediaWiki