The Complexity of Choosing an <i>H</i>-Coloring (Nearly) Uniformly at Random (Q4651471): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1904666 |
Changed an Item |
||
| Property / author | |||
| Property / author: Mike S. Paterson / rank | |||
Normal rank | |||
Revision as of 10:47, 1 March 2024
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
