Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring (Q1913697): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01955041 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2053867237 / rank | |||
Normal rank | |||
Latest revision as of 10:55, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring |
scientific article |
Statements
Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring (English)
0 references
27 May 1996
0 references
minimum vertex coloring problem
0 references
fractional coloring problem
0 references
0 references
