An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10898-006-9039-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2166742555 / rank | |||
Normal rank | |||
Revision as of 19:16, 19 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
