Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (Q881590)

From MaRDI portal
Revision as of 20:20, 25 June 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
Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights
scientific article

    Statements

    Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (English)
    0 references
    0 references
    0 references
    30 May 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    maximum constraint satisfaction problem
    0 references
    digraph \(H\)-colouring
    0 references
    complexity
    0 references
    dichotomy
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references