Erratum: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q839051): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10898-008-9362-2 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10898-008-9362-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4247132858 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10898-008-9362-2 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 04:45, 10 December 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
