An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:20, 30 January 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
