The algorithmic complexity of colour switching (Q1199936)

From MaRDI portal
Revision as of 23:09, 13 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q126857207, #quickstatements; #temporary_batch_1723583190453)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The algorithmic complexity of colour switching
scientific article

    Statements

    title
    The algorithmic complexity of colour switching (English)
    0 references
    author
    Yeow Meng Chee
    0 references
    Andrew E. B. Lim
    0 references
    publication date
    17 January 1993
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    68Q25
    0 references
    05C15
    0 references
    94A40
    0 references
    zbMATH DE Number
    96276
    0 references
    zbMATH Keywords
    graph colouring
    0 references
    colour switching problem
    0 references
    weighted matching problem
    0 references
    channel allocation
    0 references
    Wikidata QID
    Q126857207
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1199936&oldid=37585389"
    Powered by MediaWiki