An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q56210441, #quickstatements; #temporary_batch_1711234560214 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56210441 / rank | |||
Normal rank | |||
Revision as of 00:11, 24 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments |
scientific article |
Statements
An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (English)
0 references
6 March 2007
0 references
Maximum clique
0 references
Algorithm
0 references
Branch-and-bound
0 references
Approximate coloring
0 references
Computational experiments
0 references
