Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809): 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-013-0075-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2013020979 / rank | |||
Normal rank | |||
Revision as of 19:41, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Speeding up branch and bound algorithms for solving the maximum clique problem |
scientific article |
Statements
Speeding up branch and bound algorithms for solving the maximum clique problem (English)
0 references
3 July 2014
0 references
maximum clique problem
0 references
branch and bound algorithm
0 references
heuristic solution
0 references
graph colouring
0 references
