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 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Mike S. Paterson / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0097539702408363 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966994937 / rank | |||
Normal rank | |||
Latest revision as of 09:39, 30 July 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
