scientific article; zbMATH DE number 7378669
From MaRDI portal
Publication:5009556
DOI10.4230/LIPIcs.APPROX-RANDOM.2018.57MaRDI QIDQ5009556
Publication date: 4 August 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph minors. III. Planar tree-width
- Geometric bounds for eigenvalues of Markov chains
- A note on multiflows and treewidth
- Coupling with the stationary distribution and improved sampling for colorings and independent sets
- Graph minors. I. Excluding a forest
- Counting linear extensions
- The vertex separation number of a graph equals its path-width
- Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem
- The vertex separation and search number of a graph
- Glauber dynamics on trees and hyperbolic graphs
- Tree-width, path-width, and cutwidth
- Monte Carlo strategies in scientific computing.
- Nonserial dynamic programming
- Randomly coloring constant degree graphs
- Randomly coloring random graphs
- The mixing time of Glauber dynamics for coloring regular trees
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- The Glauber Dynamics for Colorings of Bounded Degree Trees
- Approximating the Permanent
- Randomly coloring sparse random graphs with fewer colors than the maximum degree
- Randomly coloring planar graphs with fewer colors than the maximum degree
- Randomly coloring graphs of girth at least five
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Randomly coloring graphs with lower bounds on girth and maximum degree
- An FPTAS for Counting Proper Four-Colorings on Cubic Graphs
- Random cluster dynamics for the Ising model is rapidly mixing
- The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree
- Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
- A Simple Algorithm for Sampling Colorings of $G(n,d/n)$ Up to The Gibbs Uniqueness Threshold
- Gibbs rapidly samples colorings of \(G(n, d/n)\)
This page was built for publication:
