A fast algorithm for the maximum clique problem (Q1613374): 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/s0166-218x(01)00290-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2046112356 / rank | |||
Normal rank | |||
Latest revision as of 08:32, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for the maximum clique problem |
scientific article |
Statements
A fast algorithm for the maximum clique problem (English)
0 references
29 August 2002
0 references
maximum independent set
0 references
maximum clique problem
0 references
branch-and-bound
0 references
random graphs
0 references
DIMACS benchmark graphs
0 references
0 references
