An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments |
scientific article; zbMATH DE number 5131216
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments |
scientific article; zbMATH DE number 5131216 |
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
0 references
0.9656069
0 references
0.9565668
0 references
0.9565668
0 references
0.95446825
0 references
0.9496801
0 references
0.94888246
0 references
0.9373405
0 references
