resumo
- We deal with graphs whose stability number can be determined by a convex quadratic program and describe algorithmic techniques for the determination of maximum stable sets in such graphs.
Convex quadratic programming applied to the stability number of a graph
Artigo de Conferência
- Visão geral
- Pesquisas
- Ver Todos
Visão geral
autores
data de publicação
- janeiro 1, 2012