Erratum: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q839051): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:20, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Erratum: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments |
scientific article |
Statements
Erratum: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (English)
0 references
1 September 2009
0 references
