|
Descripción
|
|
|---|---|
| to enhance approximate-colour exact algorithms for the maximum clique problem (MCP). NEW_SORT considers two different vertex orderings: degree and colour-based. The degree-based vertex ordering describes an improvement over a well-known vertex ordering used by exact solvers. Moreover, colour-based vertex orderings for the MCP have been traditionally considered suboptimal with respect to degree-based ones. NEW_SORT chooses the "best" of the two orderings according to a new evaluation function. The reported experiments on graphs taken from public datasets show that a leading exact solver using NEW_SORT ? and further enhanced with a strong initial solution ? can improve its performance very significantly (sometimes even exponentially). | |
|
Internacional
|
Si |
|
JCR del ISI
|
Si |
|
Título de la revista
|
Applied Intelligence |
|
ISSN
|
0924-669X |
|
Factor de impacto JCR
|
1,215 |
|
Información de impacto
|
Q3, Datos JCR del año 2015 |
|
Volumen
|
|
|
DOI
|
10.1007/s10489-016-0796-9 |
|
Número de revista
|
|
|
Desde la página
|
online |
|
Hasta la página
|
online |
|
Mes
|
MAYO |
|
Ranking
|
Area: COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE (72/130-Q3) |