Utilize este identificador para referenciar este registo: http://hdl.handle.net/10198/10653
Título: Convex quadratic programming applied to the stability number of a graph
Autor: Pacheco, Maria F.
Cardoso, Domingos Moreira
Luz, Carlos J.
Palavras-chave: Stability number
Convex quadratic programming
Maximum matching
Data: 2012
Citação: Pacheco, Maria F.; Cardoso, Domingos Moreira; Luz, Carlos J. (2012) - Convex quadratic programming applied to the stability number of a graph. In EURO 2012 - 25th European Conference on Operational Research. Vilnius, Lithuania
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 stabe sets in such graphs (except there is an induced subgraph with least adjacency eigenvalue and optimal value of the convex quadratic program not changing if the neighbourhood of any vertex is deleted). Such a graph is called adverse. Assuming that every adverse graph has convex-QP stability number, an algorithm for the recognition of graphs with convex-QP stability number is introduced and applied to the determination of maximum matchings.
Peer review: yes
URI: http://hdl.handle.net/10198/10653
Aparece nas colecções:DEMAT - Resumos em Proceedings Não Indexados ao ISI/Scopus

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
EURO2012-abstracts.pdf37,48 kBAdobe PDFVer/Abrir


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.