Martin Dyer

most citedSystematic scan for sampling colorings

35 citations · 35 across the 2 of their papers we have counts for

collaborators

2 papers

cs.CC2014

Counting $4 \times 4$ Matrix Partitions of Graphs

Martin Dyer, Leslie Ann Goldberg, David Richerby

Given a symmetric matrix $M \in {0, 1, *}^{D \times D}$ , an $M$ -partition of a graph $G$ is a function from $V (G)$ to $D$ such that no edge of $G$ is mapped to a $0$ of $M$ and no no…

math.PR2006★ 35 cited

Systematic scan for sampling colorings

Martin Dyer, Leslie Ann Goldberg, Mark Jerrum

We address the problem of sampling colorings of a graph $G$ by Markov chain simulation. For most of the article we restrict attention to proper $q$ -colorings of a path on $n$ verti…

Counting 4×4 Matrix Partitions of Graphs

Systematic scan for sampling colorings

Counting $4 \times 4$ Matrix Partitions of Graphs