Correlation decay and deterministic FPTAS for counting list-colorings of a graph
From MaRDI portal
(Redirected from Publication:2934720)
Recommendations
- Correlation decay and deterministic FPTAS for counting colorings of a graph
- Deterministic counting of graph colourings using sequences of subgraphs
- Approximate counting via correlation decay in spin systems
- Improved FPTAS for multi-spin systems
- An FPTAS for counting proper four-colorings on cubic graphs
Cited in
(15)- Sequential cavity method for computing free energy and surface pressure
- Zero-free regions of partition functions with applications to algorithms and graph limits
- A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix
- Spatial mixing and the connective constant: optimal bounds
- Improved FPTAS for multi-spin systems
- Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs
- Correlation decay and deterministic FPTAS for counting colorings of a graph
- An FPTAS for counting proper four-colorings on cubic graphs
- Deterministic counting of graph colourings using sequences of subgraphs
- Swendsen-Wang dynamics for general graphs in the tree uniqueness region
- Spectral independence in high-dimensional expanders and applications to the hardcore model
- Approximate counting via correlation decay on planar graphs
- Approximate counting via correlation decay in spin systems
- An FPTAS for the volume of some \(\mathcal{V} \)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes
- Approximating the volume of unions and intersections of high-dimensional geometric objects
This page was built for publication: Correlation decay and deterministic FPTAS for counting list-colorings of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934720)
