Randomly coloring graphs with lower bounds on girth and maximum degree-Reference-Cited by-同舟云学术

Randomly coloring graphs with lower bounds on girth and maximum degree

Published:2003-08-01 Issue:2 Volume:23 Page:167-179
ISSN:1042-9832
Container-title:Random Structures and Algorithms
language:en
Short-container-title:Random Struct. Alg.

Author:

Dyer Martin,Frieze Alan

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Reference14 articles.

1. and The probabilistic method, Wiley, New York, 1992.

2. and Path coupling: A technique for proving rapid mixing in Markov chains, Proc 38th Annu IEEE Symp Foundations of Computer Science, 1997, pp. 223-231.

3. and An extension of path coupling and its application to the Glauber dynamics for graph colourings, Proc 11th Annu ACM-SIAM Symp Discrete Algorithms, 2000, pp. 616-624.

4. A random polynomial-time algorithm for approximating the volume of convex bodies

Cited by 27 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Sampling Proper Colorings on Line Graphs Using (1+o(1))Δ Colors;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Complexity results for MCMC derived from quantitative bounds;The Annals of Applied Probability;2023-04-01

3. Correlation Decay and Partition Function Zeros: Algorithms and Phase Transitions;SIAM Journal on Computing;2022-07-26

4. Perfect sampling from spatial mixing;Random Structures & Algorithms;2022-02-18

5. A Deterministic Algorithm for Counting Colorings with 2-Delta Colors;2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS);2019-11