scientific article; zbMATH DE number 7053277
From MaRDI portal
Publication:5743398
zbMath1421.68189arXiv1107.0871MaRDI QIDQ5743398
Publication date: 10 May 2019
Full work available at URL: https://arxiv.org/abs/1107.0871
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (4)
Unnamed Item ⋮ Random-cluster dynamics on random regular graphs in tree uniqueness ⋮ Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs ⋮ A Simple Algorithm for Sampling Colorings of $G(n,d/n)$ Up to The Gibbs Uniqueness Threshold
Cites Work
- Unnamed Item
- Unnamed Item
- Random sampling of colourings of sparse random graphs with a constant number of colours
- Reconstruction and Clustering in Random Constraint Satisfaction Problems
- Randomly coloring sparse random graphs with fewer colors than the maximum degree
- Counting without sampling
- On colouring random graphs
- Factor graphs and the sum-product algorithm
- Survey propagation: An algorithm for satisfiability
- MCMC sampling colourings and independent sets of G(n, d/n) near uniqueness threshold
- Gibbs states and the set of solutions of random constraint satisfaction problems
- The two possible values of the chromatic number of a random graph
- Gibbs rapidly samples colorings of \(G(n, d/n)\)
This page was built for publication:
