A fast algorithm for the maximum clique problem (Q1613374): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56210432, #quickstatements; #temporary_batch_1704736726153 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:03, 1 February 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
