An algorithm for finding a maximum clique in a graph (Q1267190): 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.1016/s0167-6377(97)00054-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2002747011 / rank | |||
Normal rank | |||
Latest revision as of 10:31, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for finding a maximum clique in a graph |
scientific article |
Statements
An algorithm for finding a maximum clique in a graph (English)
0 references
6 October 1998
0 references
graph algorithm
0 references
maximum clique problem
0 references
branch-and-bound algorithm
0 references
vertex coloring
0 references
fractional coloring
0 references
0 references
