A fast algorithm for the maximum clique problem (Q1613374): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:03, 5 March 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
