An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10898-006-9039-7 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10898-006-9039-7 / rank | |||
Normal rank | |||
Latest revision as of 06:11, 10 December 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
0 references
