On comparing algorithms for the maximum clique problem (Q1671301): 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.1016/j.dam.2018.01.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2791564233 / rank | |||
Normal rank | |||
Revision as of 21:16, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On comparing algorithms for the maximum clique problem |
scientific article |
Statements
On comparing algorithms for the maximum clique problem (English)
0 references
6 September 2018
0 references
maximum clique
0 references
experimental algorithms
0 references
random graphs
0 references
branch and bound
0 references
