Algorithms to approximately count and sample conforming colorings of graphs (Q299070)
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 6596252
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms to approximately count and sample conforming colorings of graphs |
scientific article; zbMATH DE number 6596252 |
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
0.7848690748214722
0 references
0.781874418258667
0 references
0.7683567404747009
0 references
0.7619953155517578
0 references
