Strong spatial mixing for list coloring of graphs
The property of spatial mixing and strong spatial mixing in spin systems has been of interest because of its implications on uniqueness of Gibbs measures on infinite graphs and efficient approximation of counting problems that are otherwise known to be #P hard. In the context of coloring, strong spa...
Main Authors: | Gamarnik, David (Contributor), Katz, Dmitriy (Author), Misra, Sidhant (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Operations Research Center (Contributor), Sloan School of Management (Contributor) |
Format: | Article |
Language: | English |
Published: |
Wiley Blackwell,
2015-09-18T16:51:17Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Giant Component in Random Multipartite Graphs with given Degree Sequences
by: Gamarnik, David, et al.
Published: (2019) -
Strong List Edge Coloring of Subcubic Graphs
by: Hongping Ma, et al.
Published: (2013-01-01) -
A Note on Alternating Minimization Algorithm for the Matrix Completion Problem
by: Gamarnik, David, et al.
Published: (2017) -
On list coloring of graphs
by: Cheng-Feng Yeh, et al.
Published: (2008) -
List coloring in general graphs
by: Sengupta, Rik
Published: (2017)