Constraint and Satisfiability Reasoning for Graph Coloring (Q5129999)

From MaRDI portal
Revision as of 23:54, 23 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7269300
Language Label Description Also known as
English
Constraint and Satisfiability Reasoning for Graph Coloring
scientific article; zbMATH DE number 7269300

    Statements

    title
    Constraint and Satisfiability Reasoning for Graph Coloring (English)
    0 references
    author
    Emmanuel Hebrard
    0 references
    George Katsirelos
    0 references
    publication date
    3 November 2020
    0 references
    zbMATH Keywords
    constraint programming
    0 references
    satisfiability
    0 references
    cites work
    Q4945528
    0 references
    Q4473043
    0 references

    Identifiers

    DOI
    10.1613/jair.1.11313
    0 references
    Mathematics Subject Classification ID
    68T20
    0 references
    05C15
    0 references
    68R10
    0 references
    zbMATH DE Number
    7269300
    0 references
    OpenAlex ID
    W3083503609
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5129999&oldid=36630524"
    Powered by MediaWiki