The Complexity of Choosing an <i>H</i>-Coloring (Nearly) Uniformly at Random (Q4651471)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random |
scientific article; zbMATH DE number 2135774
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Choosing an <i>H</i>-Coloring (Nearly) Uniformly at Random |
scientific article; zbMATH DE number 2135774 |
Statements
The Complexity of Choosing an <i>H</i>-Coloring (Nearly) Uniformly at Random (English)
0 references
21 February 2005
0 references
graph coloring
0 references
graph homomorphism
0 references
computational complexity
0 references
random sampling
0 references
