Erratum: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q839051)
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: Erratum: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments |
scientific article; zbMATH DE number 5600759
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Erratum: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments |
scientific article; zbMATH DE number 5600759 |
Statements
Erratum: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (English)
0 references
1 September 2009
0 references
