Algorithms to approximately count and sample conforming colorings of graphs (Q299070): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2015.05.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2177704276 / rank | |||
Normal rank | |||
Revision as of 02:11, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms to approximately count and sample conforming colorings of graphs |
scientific article |
Statements
Algorithms to approximately count and sample conforming colorings of graphs (English)
0 references
22 June 2016
0 references
adapted colorings
0 references
Markov chains
0 references
independent sets
0 references
\(H\)-colorings
0 references
