Algorithms to approximately count and sample conforming colorings of graphs (Q299070): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2015.05.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2177704276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase Coexistence and Slow Mixing for the Hard-Core Model on ℤ2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the List Partition Problem for Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Markov Chains for Randomly H-Coloring a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison theorems for reversible Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4440427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A more rapidly mixing Markov chain for graph colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adapted list coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3447279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptable chromatic number of graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the adaptable chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of combinatorial structures from a uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adapted List Coloring of Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast convergence of the Glauber dynamics for sampling independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The adaptable choosability number grows with the choosability number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing Glauber dynamics by comparison of Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for sampling colorings / rank
 
Normal rank

Latest revision as of 04:38, 12 July 2024

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