Markov chain algorithms for Eulerian orientations and 3-colourings of 2-dimensional Cartesian grids (Q4668519)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2158969
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Markov chain algorithms for Eulerian orientations and 3-colourings of 2-dimensional Cartesian grids |
scientific article; zbMATH DE number 2158969 |
Statements
Markov chain algorithms for Eulerian orientations and 3-colourings of 2-dimensional Cartesian grids (English)
0 references
19 April 2005
0 references
Eulerian orientations
0 references
perfect matchings
0 references
polynomial algorithm
0 references
path coupling method
0 references
0.8502975702285767
0 references
0.8253106474876404
0 references
