Markov chain algorithms for Eulerian orientations and 3-colourings of 2-dimensional Cartesian grids

DOI10.1524/stnd.22.2.109.49126zbMath1133.65005OpenAlexW2277791055MaRDI QIDQ4668519

Ludger Rüschendorf, Johannes Fehrenbach

Publication date: 19 April 2005

Published in: Statistics & Decisions (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/543b611d2b6d70c0ef8528ee31d555e17c1a1509

zbMATH Keywords

polynomial algorithmperfect matchingsEulerian orientationspath coupling method

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Mixing Times of Markov Chains of 2-Orientations

This page was built for publication: Markov chain algorithms for Eulerian orientations and 3-colourings of 2-dimensional Cartesian grids