Convex quadratic programming applied to the stability number of a graph
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.
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | conferenceObject |
| Idioma: | por |
| Publicado em: |
2014
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10198/10616 |
| País: | Portugal |
| Oai: | oai:bibliotecadigital.ipb.pt:10198/10616 |
| 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. |
|---|