Algorithms to approximately count and sample conforming colorings of graphs (Q299070)

From MaRDI portal
Revision as of 04:38, 12 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
Algorithms to approximately count and sample conforming colorings of graphs
scientific article

    Statements

    Algorithms to approximately count and sample conforming colorings of graphs (English)
    0 references
    0 references
    0 references
    22 June 2016
    0 references
    adapted colorings
    0 references
    Markov chains
    0 references
    independent sets
    0 references
    \(H\)-colorings
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references