Author:
Miracle Sarah,Randall Dana
Funder
DOE Office of Science Graduate Fellowship
NSF
ARCS
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference25 articles.
1. A. Blanca, D. Galvin, D. Randall, P. Tetali, Phase co-existence and slow mixing for the hard-core model on Z2, in: Proc. 17th Workshop on Randomization and Computation, RANDOM, 2013, pp. 379–394.
2. On the sampling problem for H-colorings on the hypercubic lattice;Borgs,2004
3. The complexity of the list partition problem for graphs;Cameron;SIAM J. Discrete Math.,2007
4. On Markov chains for randomly H-coloring a graph.;Cooper;J. Algorithms,2001
5. M. Cygan, M. Pilipczuk, M. Pilipczuk, J. Wojtaszczyk, The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem). in: Proc. 22nd ACM-SIAM Symposium on Discrete Algorithms, SODA, 2011, pp. 1666–1674.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Optimality Clue for Graph Coloring Problem;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2019