Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring (Q1913697): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:26, 1 February 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
